2008年9月
AVERAGE TREE SOLUTION AND SUBCORE FOR ACYCLIC GRAPH GAMES
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN
- ,
- 巻
- 51
- 号
- 3
- 開始ページ
- 203
- 終了ページ
- 212
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.15807/jorsj.51.203
- 出版者・発行元
- ELSEVIER SCI LTD
In this paper we consider cooperative transferable utility games with limited communication structure, called graph games. Agents are able to cooperate only if they can communicate directly or indirectly with each other. For the class of acyclic graph games the average tree solution has recently been proposed. It was proven that the average tree solution is a core element if the game exhibits super-additivity. We show that the condition of super-additivity can be relaxed to a weaker condition, which admits for a natural interpretation. Moreover, we introduce the concept of subcore, which is a subset of the core, always contains the average tree solution, and therefore is a non-empty refinement of the core.
- リンク情報
- ID情報
-
- DOI : 10.15807/jorsj.51.203
- ISSN : 0453-4514
- Web of Science ID : WOS:000261432100001