On the convexity of communication games
- 103 Downloads
A communication situation consists of a game and a communication graph. By introducing two different types of corresponding communication games, point games and arc games, the Myerson value and the position value of a communication situation were introduced.
This paper investigates relations between convexity of the underlying game and the two communication games. In particular, assuming the underlying game to be convex, necessary and sufficient conditions on the communication graph are provided such that the communication games are convex. Moreover, under the same conditions, it is shown that the Myerson value and the posi tion value are in the core of the point game. Some remarks are made on superadditivity and balancedness.
KeywordsEconomic Theory Game Theory Posi Tion Communication Graph Communication Situation
Unable to display preview. Download preview PDF.
- Borm PEM, Owen G, Tijs S (1990) Values of points and arcs in communication situations. Report 9004, Dept of Mathematics, University of Nijmegen, The NetherlandsGoogle Scholar
- Myerson RB (1977) Graphs and cooperation in games. Math Oper Res 2, 225–229Google Scholar
- Owen G (1986) Values of graph-restricted games. SIAM J Alg Disc Meth 7, 210–220Google Scholar
- Shapley LS (1953) A value for n-person games. Annals of Math Studies 28, 307–317Google Scholar
- Shapley LS (1971) Cores of convex games. Int J of Game Theory 1, 11–26Google Scholar