.png){kind=icon}
返回
COOPERATIVE GAMES ARISING FROM NETWORK FLOW PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(91)90315-M.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We give a new class of mathematical programming games without side payments that have nonempty cores. In these games, players control nodes or arcs in a network and participate in optimizing an objective function while attempting to share the costs or returns. Disjoint paths in the network correspond to alternative production routes or streams of jobs that are concurrently processed and yield costs or returns along the way; the problem of fair cost allocation or profit sharing motivates the formulation of a cooperative game. Our results extend work on games with side payments, and are relevant for situations in which the various players involved have dissimilar and nonlinear utilities for the generated returns. For some games of this type efficient algorithms exist to allocate costs or revenues among the players.
Keyword:
GAMES
NETWORKS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
没有更多内容
没有更多内容