International Journal of Game Theory

, Volume 42, Issue 2, pp 339–355 | Cite as

On the core: complement-reduced game and max-reduced game

  • Yan-An Hwang


This paper presents two characterizations of the core on the domain of all NTU games. One is based on consistency with respect to “complement-reduced game” and converse consistency with respect to “max-reduced game”. The other is based on consistency with respect to “max-reduced game” and weak converse consistency with respect to “complement-reduced game”. Besides, we introduce an alternative definition of individual rationality, we name conditional individual rationality, which is compatible with non-emptiness. We discuss axiomatic characterizations involving conditional individual rationality for the core.


Core Reduced game Consistency Converse consistency  Conditional individual rationality 



The author is very grateful to the AE and anonymous referees for valuable comments which much improved the paper.


  1. Aumann RJ, Dréze J (1974) Cooperative games with coalition structures. Int J Game Theory 3:217–237CrossRefGoogle Scholar
  2. Bejan C, Gómez JC (2009) Core extensions for non-balanced TU games. Int J Game Theory 38:3–16CrossRefGoogle Scholar
  3. Davis M, Maschler M (1965) The kernel of a cooperative game. Nav Res Logist Q 12:223–259CrossRefGoogle Scholar
  4. Greenberg J (1985) Cores of convex games without side payments. Math Oper Res 10:523–525CrossRefGoogle Scholar
  5. Harsanyi JC (1959) A bargaining model for the cooperative n-person games. In: Tucker AW, Luce RD (eds) Contributions to the theory of games IV. Princeton University Press, Princeton , pp 325–355Google Scholar
  6. Hart S (1985) An axiomatization of Harsanyi’s nontransferable utility solution. Econometrica 53:1295–1313CrossRefGoogle Scholar
  7. Hart S, Mas-Colell A (1989) Potential, value, and consistency. Econometrica 57:589–614CrossRefGoogle Scholar
  8. Hwang YA, Sudhölter P (2001) Axiomatizations of the core on the universal domain and other natural domains. Int J Game Theory 29:597–623CrossRefGoogle Scholar
  9. Imai H (1983) Individual monotonicity and lexicographic maximin solutions. Econometrica 51:389–401CrossRefGoogle Scholar
  10. Moulin H (1985) The separability axiom and equal sharing methods. J Econ Theory 36:120–148CrossRefGoogle Scholar
  11. Nash J (1950) The bargaining problem. Econometrica 18:155–162CrossRefGoogle Scholar
  12. Orshan G, Sudhölter P (2010) The positive core of a cooperative game. Int J Game Theory 39:113–136CrossRefGoogle Scholar
  13. Peleg B (1985) An axiomatization of the core of cooperative games without side payments. J Math Econ 14:203–214CrossRefGoogle Scholar
  14. Peleg B (1986) On the reduced game property and its converse. Int J Game Theory 15:187–200CrossRefGoogle Scholar
  15. Roth AE (1977) Independence of irrelevant alternatives and solutions to Nash’s bargaining problem. J Econ Theory 16:247–251CrossRefGoogle Scholar
  16. Serrano R, Volij O (1998) Axiomatizations of neoclassical concepts for economies. J Math Econ 30:87–108CrossRefGoogle Scholar
  17. Sobolev AI (1975) The characterization of optimality principles in cooperative games by functional equations. In: Vorobiev NN (ed) Mathematical methods in the social sciences, vol 6. Academy of Sciences of the Lithuanian SSR, Vilnius, pp 95–151 (in Russian)Google Scholar
  18. Tadenuma K (1992) Reduced games, consistency, and the core. Int J Game Theory 20:325–334CrossRefGoogle Scholar
  19. Thomson W (1995) Consistent allocation rules. University of Rochester, MimeoGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Department of Applied MathematicsNational Dong Hwa UniversityHualienTaiwan

Personalised recommendations