Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

On the convexity of communication games


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.

This is a preview of subscription content, log in to check access.


  1. Borm PEM, Owen G, Tijs S (1990) Values of points and arcs in communication situations. Report 9004, Dept of Mathematics, University of Nijmegen, The Netherlands

  2. Myerson RB (1977) Graphs and cooperation in games. Math Oper Res 2, 225–229

  3. Owen G (1986) Values of graph-restricted games. SIAM J Alg Disc Meth 7, 210–220

  4. Shapley LS (1953) A value for n-person games. Annals of Math Studies 28, 307–317

  5. Shapley LS (1971) Cores of convex games. Int J of Game Theory 1, 11–26

Download references

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

van den Nouweland, A., Borm, P. On the convexity of communication games. Int J Game Theory 19, 421–430 (1991).

Download citation


  • Economic Theory
  • Game Theory
  • Posi Tion
  • Communication Graph
  • Communication Situation