Social Choice and Welfare

, Volume 45, Issue 4, pp 819–827 | Cite as

Efficient extensions of the Myerson value

Article

Abstract

We study values for transferable utility games enriched by a communication graph (CO-games) where the graph does not necessarily affect the productivity but can influence the way the players distribute the worth generated by the grand coalition. Thus, we can envisage values that are efficient instead of values that are component efficient. For CO-games with connected graphs, efficiency and component efficiency coincide. In particular, the Myerson value (Myerson in Math Oper Res 2:22–229, 1977) is efficient for such games. Moreover, fairness is characteristic of the Myerson value. We identify the value that is efficient for all CO-games, coincides with the Myerson value for CO-games with connected graphs, and satisfies fairness.

Mathematics Subject Classification

91A12 

JEL Classification

C71  D60 

Notes

Acknowledgments

We are grateful to René van den Brink for valuable comments on this article. Financial support for Frank Huettner from the Deutsche Forschungsgemeinschaft (DFG) Grant HU 2205/1-1 is gratefully acknowledged. Moreover, financial support from research programs “DynaMITE: Dynamic Matching and Interactions: Theory and Experiments”, contract ANR-13-BSHS1-0010, and MODMAD is gratefully acknowledged.

References

  1. Aumann RJ, Drèze JH (1974) Cooperative games with coalition structures. Int J Game Theory 3:217–237CrossRefGoogle Scholar
  2. Béal S, Rémila E, Solal P (2012) Fairness and fairness for neighbors: The difference between the Myerson value and component-wise egalitarian solutions. Econ Lett 117:263–267CrossRefGoogle Scholar
  3. Casajus A (2007) An efficient value for TU games with a cooperation structure. Working paper, Universität Leipzig, GermanyGoogle Scholar
  4. Casajus A (2009) Networks and outside options. Soc Choice Welf 32(1):1–13CrossRefGoogle Scholar
  5. Hamiache G (2012) A matrix approach to TU games with coalition and communication structures. Soc Choice Welf 38:85–100CrossRefGoogle Scholar
  6. Hart S, Kurz M (1983) Endogenous formation of coalitions. Econometrica 51:1047–1064CrossRefGoogle Scholar
  7. Myerson RB (1977) Graphs and cooperation in games. Math Oper Res 2:225–229CrossRefGoogle Scholar
  8. Owen G (1977) Values of games with a priori unions. In: Henn R, Moeschlin O (eds) Essays in mathematical economics & game theory. Springer, Berlin, pp 76–88CrossRefGoogle Scholar
  9. Shapley LS (1953) A value for \(n\)-person games. In: Kuhn H, Tucker A (eds) Contributions to the theory of games, vol II. Princeton University Press, Princeton, pp 307–317Google Scholar
  10. van den Brink R, Khmelnitskaya A, van der Laan G (2012) An efficient and fair solution for communication graph games. Econ Lett 117:786–789CrossRefGoogle Scholar
  11. van den Nouweland A (1993) Games and graphs in economic situations. Ph.D. thesis, Tilburg University, The NetherlandsGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Sylvain Béal
    • 1
  • André Casajus
    • 2
    • 3
  • Frank Huettner
    • 2
    • 3
  1. 1.Université de Franche-Comté, CRESEBesançonFrance
  2. 2.Economics and Information SystemsHHL Leipzig Graduate School of ManagementLeipzigGermany
  3. 3.LSI Leipziger Spieltheoretisches InstitutLeipzigGermany

Personalised recommendations