[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Convex decomposition of games and axiomatizations of the core and the D-core

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

Abstract

This paper provides an axiomatic framework to compare the D-core (the set of undominated imputations) and the core of a cooperative game with transferable utility. Theorem 1 states that the D-core is the only solution satisfying projection consistency, reasonableness (from above), (*)-antimonotonicity, and modularity. Theorem 2 characterizes the core replacing (*)-antimonotonicity by antimonotonicity. Moreover, these axioms also characterize the core on the domain of convex games, totally balanced games, balanced games, and superadditive games.

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

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Chang C (2000) Note: remarks on theory of the core. Nav Res Logist 47:456–458

    Article  Google Scholar 

  • Davis M, Maschler M (1965) The kernel of a cooperative game. Nav Res Logist Q 12:223–259

    Google Scholar 

  • Driessen T (1991) A survey of consistency properties in cooperative game theory. SIAM Rev 33:43–59

    Article  Google Scholar 

  • Funaki Y, Yamato T (2001) The core and consistency properties: a general characterization. Int Game Theory Rev 3:175–187

    Article  Google Scholar 

  • Gillies D (1959) Solutions to general non-zero sum games. In: Tucker A, Luce R (eds) Contributions to the theory of games, vol IV. Annals of mathematical studies, vol 40. Princeton University Press, Princeton, pp 47–58

    Google Scholar 

  • Hwang Y-A, Sudhölter P (2001) An axiomatization of the core on the universal domain and other natural domains. Int J Game Theory 29:597–623

    Article  Google Scholar 

  • Keiding H (1986) An axiomatization of the core of a cooperative game. Econ Lett 20:111–115

    Article  Google Scholar 

  • Llerena F, Rafels C (2006) The vector lattice structure of the n-person TU games. Games Econ Behav 54:373–379

    Article  Google Scholar 

  • Lucas W (1992) von Neumann–Morgenstern stable sets. In: Aumann R, Hart S (eds) Handbook of game theory, vol I. North-Holland, Amsterdam, pp 543–590

    Google Scholar 

  • Maschler M (1992) The bargaining set, kernel, and nucleolus. In: Aumann R, Hart S (eds) Handbook of game theory, vol I. North-Holland, Amsterdam, pp 543–590

    Google Scholar 

  • Milnor J (1952) Reasonable outcomes for n-person games. The Rand Corporation 916

  • Moulin H (1985) The separability axiom and equal sharing methods. J Econ Theory 36:120–148

    Article  Google Scholar 

  • Peleg B (1986) On the reduced game property and its converse. Int J Game Theory 15:187–200

    Article  Google Scholar 

  • Peleg B, Sudhölter P (2003) Introduction to the theory of cooperative games. Kluwer, Boston

    Google Scholar 

  • Rafels C, Tijs S (1997) On the cores of cooperative games and the stability of the Weber set. Int J Game Theory 26:491–499

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Sudhölter P, Peleg B (2000) The positive prekernel of a cooperative game. Int Game Theory Rev 2:287–305

    Article  Google Scholar 

  • Tadenuma K (1992) Reduced games, consistency, and the core. Int J Game Theory 20:325–334

    Article  Google Scholar 

  • Thomson W (1998) Consistent allocation rules. Dicussion Paper, Department of Economics, University of Rochester, USA

  • Voorneveld M, van den Nouweland A (1998) A new axiomatization of the core of games with transferable utility. Econ Lett 60:151–155

    Article  Google Scholar 

  • Winter E, Wooders M (1994) An axiomatization of the core for finite and continuum games. Soc Choice Welf 11:165–175

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Francesc Llerena.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Llerena, F., Rafels, C. Convex decomposition of games and axiomatizations of the core and the D-core. Int J Game Theory 35, 603–615 (2007). https://doi.org/10.1007/s00182-006-0062-1

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00182-006-0062-1

Keywords

JEL Classification

Navigation