Skip to main content
Log in

A note: characterizations of convex games by means of population monotonic allocation schemes

  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

Abstract

Convex cooperative games were first introduced by Shapley (Int J Game Theory 1:11–26, 1971) while population monotonic allocation schemes (PMAS) were subsequently proposed by Sprumont (Games Econ Behav 2:378–394, 1990). In this paper we provide several characterizations of convex games and introduce three new notions: PMAS-extendability, PMAS-exactness, and population monotonic set schemes, which imitate the classical concepts that they extend. We show that all of these notions provide new characterizations of the convexity of the game.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Biswas AK, Parthasarathy T, Potters JAM, Voorneveld M (1999) Large cores and exactness. Games Econ Behav 28:1–12

    Article  Google Scholar 

  • Çiftçi B, Borm P, Hamers H (2010) Population monotonic path schemes for simple games. Theory Decis 69(2):205–218

    Article  Google Scholar 

  • Hendrickx R, Borm P, Timmer J (2002) A note on NTU convexity. Int J Game Theory 31:29–37

    Article  Google Scholar 

  • Ichiishi T (1981) Super-modularity: applications to convex games and to the greedy algorithm for LP. J Econ Theory 25:283–286

    Article  Google Scholar 

  • Izquierdo JM, Rafels C (2012) A characterization of convex TU games by means of the Mas-Colell bargaining set (à la Shimomura). Int J Game Theory 41:381–395

    Article  Google Scholar 

  • Kikuta K, Shapley L (1986) Core stability in n-person games. Unpublished manuscript

  • Moulin H (1990) Cores and large cores when population varies. Int J Game Theory 19:219–232

    Article  Google Scholar 

  • Peleg B, Sudhölter P (2007) Introduction to the theory of cooperative games, 2nd edn. Springer, Berlin

    Google Scholar 

  • Schmeidler D (1972) Cores of exact games. J Math Anal Appl 40:214–225

    Article  Google Scholar 

  • Shapley L (1953) A value for n-person games. In: Kuhn H, Tucker A (eds) Contributions to the theory of games II. Princeton University Press, Princeton, pp 307–317

    Google Scholar 

  • Shapley L (1971) Cores of convex games. Int J Game Theory 1:11–26

    Article  Google Scholar 

  • Sharkey WW (1982) Cooperative games with large cores. Int J Game Theory 11:175–182

    Article  Google Scholar 

  • Sprumont Y (1990) Population monotonic allocation schemes for cooperative games with transferable utility. Games Econ Behav 2:378–394

    Article  Google Scholar 

  • van Gellekom JRG, Potters JAM, Reijnierse JH (1999) Prosperity properties of TU-games. Int J Game Theory 28:211–227

    Article  Google Scholar 

Download references

Acknowledgments

We thank J. M. Izquierdo, J. Martínez de Albéniz and M. Núñez for their valuable comments. Institutional support from the Ministerio de Ciencia e Innovación and FEDER under grant ECO2011-22765, and from the Generalitat de Catalunya under grant 2009SGR0960 is acknowledged.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jesús Getán.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Getán, J., Montes, J. & Rafels, C. A note: characterizations of convex games by means of population monotonic allocation schemes. Int J Game Theory 43, 871–879 (2014). https://doi.org/10.1007/s00182-013-0408-4

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00182-013-0408-4

Keywords

Navigation