ALLOCATION RULES FOR HYPERGRAPH COMMUNICATION SITUATIONS

被引：59

作者：

VANDENNOUWELAND, A

BORM, P

TIJS, S

机构：

[1] Department of Econometrics, Tilburg University, LE Tilburg, 5000

来源：

INTERNATIONAL JOURNAL OF GAME THEORY | 1992年 / 20卷 / 03期

关键词：

D O I：

10.1007/BF01253780

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

This paper considers hypergraph communication situations, where for a group of agents the economic possibilities are described by a coalitional game and the communication possibilities are described by a hypergraph in which the nodes are the agents and the edges are the subgroups of agents who can effect communication. Axiomatic characterizations are provided for two allocation rules, the Myerson value and the position value.

引用

页码：255 / 268

页数：14

共 8 条

[1] Aumann R., 1988, SHAPLEY VALUE, P175, DOI 10.1017/CBO9780511528446.013
[2] Berge C., 1989, N HOLLAND MATH LIB, V45, P1
[3] BORM PEM, 1991, IN PRESS SIAM J DISC
[4] Meessen R., 1988, THESIS U NIJMEGEN NE
[5] Myerson R. B., 1980, International Journal of Game Theory, V9, P169, DOI 10.1007/BF01781371
[6] Myerson R. B., 1977, Mathematics of Operations Research, V2, P225, DOI 10.1287/moor.2.3.225
[7] VALUES OF GRAPH-RESTRICTED GAMES
OWEN, G
[J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1986, 7 (02): : 210 - 220
[8] Shapley L.S., 1953, VALUE N PERSON GAMES, V28, P307

← 1 →