Skip to main content

Cooperative Games (Von Neumann-Morgenstern Stable Sets)

  • Living reference work entry
  • Latest version View entry history
  • First Online:
Encyclopedia of Complexity and Systems Science

Glossary

Abstract game :

An abstract game consists of a set of outcomes and a binary relation, called domination, on the outcomes. Von Neumann and Morgenstern presented this game form for general applications of stable sets.

Characteristic function form game :

A characteristic function form game consists of a set of players and a characteristic function that gives each group of players, called a coalition, a value or a set of payoff vectors that they can gain by themselves. It is a typical representation of cooperative games. For characteristic function form games, several solution concepts are defined such as von Neumann-Morgenstern stable set, core, bargaining set, kernel, nucleolus, and Shapley value.

Domination :

Domination is a binary relation defined on the set of imputations, outcomes, or strategy combinations, depending on the form of a given game. In characteristic function form games, an imputation is said to dominate another imputation if there is a coalition of players such...

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

Access this chapter

Institutional subscriptions

Bibliography

  • Anesi V (2006) Committee with farsighted voters: a new interpretation of stable sets. Soc Choice Welf 27:595–610

    Article  MathSciNet  MATH  Google Scholar 

  • Anesi V (2010) Noncooperative foundations of stable sets in voting games. Games Econ Behav 70:488–493

    Article  MathSciNet  MATH  Google Scholar 

  • Aumann R, Peleg B (1960) Von Neumann-Morgenstern solutions to cooperative games without side payments. Bull Am Math Soc 66:173–179

    Article  MATH  Google Scholar 

  • Bala V, Goyal S (2000) A noncooperative model of network formation. Econometrica 68:1181–1229

    Article  MathSciNet  MATH  Google Scholar 

  • Bando K (2014) On the existence of a strictly strong Nash equilibrium under the student-optimal deferred acceptance algorithm. Games Econ Behav 87:269–287

    Article  MathSciNet  MATH  Google Scholar 

  • Banerjee S, Konishi H, Sonmez T (2001) Core in a simple coalition formation game. Soc Choice Welf 18:135–153

    Article  MathSciNet  MATH  Google Scholar 

  • Barberá S, Gerber A (2003) On coalition formation: durable coalition structures. Math Soc Sci 45:185–203

    Article  MathSciNet  MATH  Google Scholar 

  • Beal S, Durieu J, Solal P (2008) Farsighted coalitional stability in TU-games. Math Soc Sci 56:303–313

    Article  MathSciNet  MATH  Google Scholar 

  • Bernheim D, Peleg B, Whinston M (1987) Coalition-proof Nash equilibria: Concepts. J Econ Theory 42:1–12

    Article  MathSciNet  MATH  Google Scholar 

  • Bhattacharya A, Brosi V (2011) An existence result for farsighted stable sets of games in characteristic function form. Int J Game Theory 40:393–401

    Article  MathSciNet  MATH  Google Scholar 

  • Bogomolnaia A, Jackson MO (2002) The stability of hedonic coalition structures. Games Econ Behav 38:201–230

    Article  MathSciNet  MATH  Google Scholar 

  • Bott R (1953) Symmetric solutions to majority games. In: Kuhn HW, Tucker AW (eds) Contribution to the theory of games, volume II, Annals of mathematics studies, vol 28. Princeton University Press, Princeton, pp 319–323

    Google Scholar 

  • Chwe MS-Y (1994) Farsighted coalitional stability. J Econ Theory 63:299–325

    Article  ADS  MathSciNet  MATH  Google Scholar 

  • Diamantoudi E (2005) Stable cartels revisited. Econ Theory 26:907–921

    Article  MathSciNet  MATH  Google Scholar 

  • Diamantoudi E, Xue L (2003) Farsighted stability in hedonic games. Soc Choice Welf 21:39–61

    Article  MathSciNet  MATH  Google Scholar 

  • Diamantoudi E, Xue L (2007) Coalitions, agreements and efficiency. J Econ Theory 136:105–125

    Article  MathSciNet  MATH  Google Scholar 

  • Diermeier D, Fong P (2012) Characterization of the von Neumann-Morgenstern stable set in a non-cooperative model of dynamic policy-making with a persistent agenda setter. Games Econ Behav 76:349–353

    Article  MathSciNet  MATH  Google Scholar 

  • Dutta B, Vohra R (2017) Rational expectations and farsighted stability. Theor Econ 12:1191–1227

    Article  MathSciNet  Google Scholar 

  • Ehlers L (2007) Von Neumann-Morgenstern stable sets in matching problems. J Econ Theory 134:537–547

    Article  MathSciNet  MATH  Google Scholar 

  • Einy E, Shitovitz B (1996) Convex games and stable sets. Games Econ Behav 16:192–201

    Article  MathSciNet  MATH  Google Scholar 

  • Einy E, Holzman R, Monderer D, Shitovitz B (1996) Core and stable sets of large games arising in economics. J Econ Theory 68:200–211

    Article  MathSciNet  MATH  Google Scholar 

  • Funaki Y, Yamato T (2014) Stable coalition structures under restricted coalitional changes. Int Game Theory Rev 16. https://doi.org/10.1142/S0219198914500066

  • Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69:9–15

    Article  MathSciNet  MATH  Google Scholar 

  • Gomes A (2005) Multilateral contracting with externalities. Econometrica 73:1329–1350

    Article  MathSciNet  MATH  Google Scholar 

  • Gomes A, Jehiel P (2005) Dynamic process of social and economic interactions: on the persistence of inefficiencies. J Pol Econ 113:626–667

    Article  Google Scholar 

  • Graziano MG, Meo C, Yannelis NC (2015) Stable sets for asymmetric information economies. Int J Econ Theory 11:137–154

    Article  MathSciNet  Google Scholar 

  • Greenberg J (1990) The theory of social situations: an alternative game theoretic approach. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  • Greenberg J, Monderer D, Shitovitz B (1996) Multistage situations. Econometrica 64:1415–1437

    Article  MathSciNet  MATH  Google Scholar 

  • Greenberg J, Luo X, Oladi R, Shitovitz B (2002) (Sophisticated) stable sets in exchange economies. Games Econ Behav 39:54–70

    Article  MathSciNet  MATH  Google Scholar 

  • Griesmer JH (1959) Extreme games with three values. In: Tucker AW, Luce RD (eds) Contribution to the theory of games, vol IV. Annals of mathematics studies, vol 40. Princeton University Press, Princeton, pp 189–212

    Google Scholar 

  • Gusfield D, Irving R (1989) The stable marriage problem: structure and algorithms. MIT Press, Boston

    MATH  Google Scholar 

  • Harsanyi J (1974) An equilibrium-point interpretation of stable sets and a proposed alternative definition. Manag Sci 20:1472–1495

    Article  MathSciNet  MATH  Google Scholar 

  • Hart S (1973) Symmetric solutions of some production economies. Int J Game Theory 2:53–62

    Article  MathSciNet  MATH  Google Scholar 

  • Hart S (1974) Formation of cartels in large markets. J Econ Theory 7:453–466

    Article  MathSciNet  Google Scholar 

  • Heijmans J (1991) Discriminatory von Neumann-Morgenstern solutions. Games Econ Behav 3:438–452

    Article  MathSciNet  MATH  Google Scholar 

  • Herings PJJ, Mauleon A, Vannetelbosch V (2009) Farsightedly stable networks. Games Econ Behav 67:526–541

    Article  MathSciNet  MATH  Google Scholar 

  • Herings PJJ, Mauleon A, Vannetelbosch V (2010) Coalition formation among farsighted agents. Games 1:286–298

    Article  MathSciNet  MATH  Google Scholar 

  • Herings PJJ, Mauleon A, Vannetelbosch V (2017) Stable sets in matching problems with coalitional sovereignty and path dominance. J Math Econ 71:14–19

    Article  MathSciNet  MATH  Google Scholar 

  • Herings PJJ, Mauleon A, Vannetelbosch V (2018) Stability of networks under horizon-K farsightedness. Econ Theory. https://doi.org/10.1007/s00199-018-1119-7

  • Hirai T (2017) Single payoff farsighted stable sets in strategic games with punishment strategies. Int J Game Theory. https://doi.org/10.1007/s00182-017-0597-3

  • Jackson MO, van den Nouweland A (2005) Strongly stable networks. Games Econ Behav 51:420–444

    Article  MathSciNet  MATH  Google Scholar 

  • Jackson MO, Wolinsky A (1996) A strategic model of social and economic networks. J Econ Theory 71:44–74

    Article  MathSciNet  MATH  Google Scholar 

  • Jordan JS (2006) Pillage and property. J Econ Theory 131:26–44

    Article  MathSciNet  MATH  Google Scholar 

  • Kamijo Y, Muto S (2010) Farsighted coalitional stability of a price leadership cartel. Jpn Econ Rev 61:455–465

    Article  MathSciNet  Google Scholar 

  • Kaneko M (1987) The conventionally stable sets in noncooperative games with limited observations I: definition and introductory argument. Math Soc Sci 13:93–128

    Article  MathSciNet  MATH  Google Scholar 

  • Kawasaki R (2010) Farsighted stability of the competitive allocations in an exchange economy with indivisible goods. Math Soc Sci 59:46–52

    Article  MathSciNet  MATH  Google Scholar 

  • Kawasaki R (2015) Maximin, minimax, and von Neumann-Morgenstern farsighted stable sets. Math Soc Sci 74:8–12

    Article  MathSciNet  MATH  Google Scholar 

  • Kawasaki R, Muto S (2009) Farsighted stability in provision of perfectly lumpy public goods. Math Soc Sci 58:98–109

    Article  MathSciNet  MATH  Google Scholar 

  • Kawasaki R, Sato T, Muto S (2015) Farsightedly stable tariffs. Math Soc Sci 76:118–124

    Article  MathSciNet  MATH  Google Scholar 

  • Kerber M, Rowat C (2011) A Ramsey bound on stable sets in Jordan pillage games. Int J Game Theory 40:461–466

    Article  MathSciNet  MATH  Google Scholar 

  • Kirchsteiger G, Mantovani M, Mauleon A, Vannetelbosch V (2016) Limited farsightedness in network formation. J Econ Behav Organ 128:97–120

    Article  Google Scholar 

  • Konishi H, Ray D (2003) Coalition formation as a dynamic process. J Econ Theory 110:1–41

    Article  MathSciNet  MATH  Google Scholar 

  • Klaus B, Klijn F, Walzl M (2010) Farsighted house allocation. J Math Econ 46:817–824

    Article  MathSciNet  MATH  Google Scholar 

  • Klaus B, Klijn F, Walzl M (2011) Farsighted stability for roommate markets. J Pub Econ Theory 13:921–933

    Article  MATH  Google Scholar 

  • Lucas WF (1968) A game with no solution. Bull Am Math Soc 74:237–239

    Article  MathSciNet  MATH  Google Scholar 

  • Lucas WF (1990) Developments in stable set theory. In: Ichiishi T et al (eds) Game theory and applications. Academic, New York, pp 300–316

    Chapter  Google Scholar 

  • Lucas WF, Rabie M (1982) Games with no solutions and empty cores. Math Oper Res 7:491–500

    Article  MathSciNet  MATH  Google Scholar 

  • Lucas WF, Michaelis K, Muto S, Rabie M (1982) A new family of finite solutions. Int J Game Theory 11:117–127

    Article  MathSciNet  MATH  Google Scholar 

  • Lucas WF (1992) Von Neumann-Morgenstern stable sets. In: Aumann RJ, Hart S (eds) Handbook of game theory with economic applications, vol 1. North-Holland, Amsterdam, pp 543–590

    Chapter  Google Scholar 

  • Luo X (2001) General systems and Ï•-stable sets: a formal analysis of socioeconomic environments. J Math Econ 36:95–109

    Article  ADS  MathSciNet  MATH  Google Scholar 

  • Luo X (2009) On the foundation of stability. Econ Theory 40:185–201

    Article  ADS  MathSciNet  MATH  Google Scholar 

  • Manlove D (2013) Algorithmics of matching under preferences. World Scientific, Singapore

    Book  MATH  Google Scholar 

  • Mariotti M (1997) A model of agreements in strategic form games. J Econ Theory 74:196–217

    Article  MathSciNet  MATH  Google Scholar 

  • Masuda T (2002) Farsighted stability in average return games. Math Soc Sci 44:169–181

    Article  MathSciNet  MATH  Google Scholar 

  • Mauleon A, Vannetelbosch V (2004) Farsighted and cautiousness in coalition formation games with positive spillovers. Theory Dec 56:291–324

    Article  MATH  Google Scholar 

  • Mauleon A, Vannetelbosch V, Vergote W (2011) Von Neumann-Morgenstern farsightedly stable sets in two-sided matching. Theor Econ 6:499–521

    Article  MathSciNet  MATH  Google Scholar 

  • Mauleon A, Molis E, Vannetelbosch V, Vergote W (2014) Dominance invariant one-to-one matching problems. Int J Game Theory 43:925–943

    Article  MathSciNet  MATH  Google Scholar 

  • Moulin H (1995) Cooperative microeconomics: a game-theoretic introduction. Princeton University Press, Princeton

    Book  Google Scholar 

  • Muto S (1979) Symmetric solutions for symmetric constant-sum extreme games with four values. Int J Game Theory 8:115–123

    Article  MathSciNet  MATH  Google Scholar 

  • Muto S (1982a) On Hart production games. Math Oper Res 7:319–333

    Article  MathSciNet  MATH  Google Scholar 

  • Muto S (1982b) Symmetric solutions for (n, k) games. Int J Game Theory 11:195–201

    Article  MathSciNet  MATH  Google Scholar 

  • Muto S, Okada D (1996) Von Neumann-Morgenstern stable sets in a price-setting duopoly. Econ Econ 81:1–14

    Google Scholar 

  • Muto S, Okada D (1998) Von Neumann-Morgenstern stable sets in Cournot competition. Econ Econ 85:37–57

    Google Scholar 

  • Nakanishi N (1999) Reexamination of the international export quota game through the theory of social situations. Games Econ Behav 27:132–152

    Article  MathSciNet  MATH  Google Scholar 

  • Nakanishi N (2001) On the existence and efficiency of the von Neumann-Morgenstern stable set in an n-player prisoner’s dilemma. Int J Game Theory 30:291–307

    Article  MathSciNet  MATH  Google Scholar 

  • Nakanishi N (2009) Noncooperative farsighted stable set in an n-player prisoners’ dilemma. Int J Game Theory 38:249–261

    Article  MathSciNet  MATH  Google Scholar 

  • Nakayama M (1998) Self-binding coalitions. Keio Econ Stud 35:1–8

    Google Scholar 

  • Núñez M, Rafels C (2013) Von Neumann-Morgenstern solutions in the assignment market. J Econ Theory 148:1282–1291

    Article  MathSciNet  MATH  Google Scholar 

  • Oladi R (2005) Stable tariffs and retaliation. Rev Int Econ 13:205–215

    Article  Google Scholar 

  • Owen G (1965) A class of discriminatory solutions to simple N-person games. Duke Math J 32:545–553

    Google Scholar 

  • Owen G (1968) n-Person games with only l, n-l, and n-person coalitions. Proc Am Math Soc 19:1258–1261

    MathSciNet  MATH  Google Scholar 

  • Owen G (1995) Game theory, 3rd edn. Academic, New York

    MATH  Google Scholar 

  • Page FH, Wooders M (2009) Strategic basins of attraction, the path dominance core, and network formation games. Games Econ Behav 66:462–487

    Article  MathSciNet  MATH  Google Scholar 

  • Page FH, Wooders MH, Kamat S (2005) Networks and farsighted stability. J Econ Theory 120:257–269

    Article  MathSciNet  MATH  Google Scholar 

  • Peleg B (1986) A proof that the core of an ordinal convex game is a von Neumann-Morgenstern solution. Math Soc Sci 11:83–87

    Article  MathSciNet  MATH  Google Scholar 

  • Quint T, Wako J (2004) On houseswapping, the strict core, segmentation, and linear programming. Math Oper Res 29:861–877

    Article  MathSciNet  MATH  Google Scholar 

  • Ray D, Vohra R (1997) Equilibrium binding agreements. J Econ Theory 73:30–78

    Article  MathSciNet  MATH  Google Scholar 

  • Ray D, Vohra R (2015a) The farsighted stable set. Econometrica 83:977–1011

    Article  MathSciNet  Google Scholar 

  • Ray D, Vohra R (2015b) Coalition formation. In: Young HP, Zamir S (eds) Handbook of game theory, vol 4. Elsevier/North Holland, pp 239–326

    Google Scholar 

  • Rosenmüller J (1977) Extreme games and their solutions, Lecture notes in economics and mathematical systems, vol 145. Springer, Berlin

    MATH  Google Scholar 

  • Rosenmüller J, Shitovitz B (2000) A characterization of vNM-stable sets for linear production games. Int J Game Theory 29:39–61

    Article  MathSciNet  MATH  Google Scholar 

  • Roth AE, Postlewaite A (1977) Weak versus strong domination in a market with indivisible goods. J Math Econ 4:131–137

    Article  MathSciNet  MATH  Google Scholar 

  • Roth AE, Sotomayor MO (1990) Two-sided matching: a study in game-theoretic modeling and analysis. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  • Roth AE, Vande Vate JH (1990) Random paths to stability in two-sided matching. Econometrica 58:1475–1480

    Article  MathSciNet  MATH  Google Scholar 

  • Serrano R, Volij O (2008) Mistakes in cooperation: the stochastic stability of Edgeworth’s recontracting. Econ J 118:1719–1741

    Article  Google Scholar 

  • Shapley LS (1953) Quota solutions of n-person games. In: Kuhn HW, Tucker TW (eds) Contribution to the theory of games, vol II. Annals of mathematics studies, vol 28. Princeton University Press, Princeton, pp 343–359

    Google Scholar 

  • Shapley LS (1959) The solutions of a symmetric market game. In: Tucker AW, Luce RD (eds) Contribution to the theory of games, vol IV. Annals of mathematics studies, vol 40. Princeton University Press, Princeton, pp 145–162

    Google Scholar 

  • Shapley LS (1962) Simple games: an outline of the descriptive theory. Behav Sci 7:59–66

    Article  MathSciNet  Google Scholar 

  • Shapley LS (1964) Solutions of compound simple games. In: Tucker AW et al (eds) Advances in game theory. Annals of mathematics studies, vol 52. Princeton University Press, Princeton, pp 267–305

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Shapley LS, Scarf H (1974) On cores and indivisibilities. J Math Econ 1:23–37

    Article  MATH  Google Scholar 

  • Shapley LS, Shubik M (1972) The assignment game I: the core. Int J Game Theory 1:111–130

    Article  MathSciNet  MATH  Google Scholar 

  • Shino J, Kawasaki R (2012) Farsighted stable sets in Hotelling’s location games. Math Soc Sci 63:23–30

    Article  MathSciNet  MATH  Google Scholar 

  • Shitovitz B, Weber S (1997) The graph of Lindahl correspondence as the unique von Neumann-Morgenstern abstract stable set. J Math Econ 27:375–387

    Article  MathSciNet  MATH  Google Scholar 

  • Shubik M (1982) Game theory in the social sciences: concepts and solutions. MIT Press, Boston

    MATH  Google Scholar 

  • Shubik M (1985) A game-theoretic approach to political economy. MIT Press, Boston

    MATH  Google Scholar 

  • Simonnard M (1966) Linear programming. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  • Solymosi T, Raghavan TES (2001) Assignment games with stable core. Int J Game Theory 30:177–185

    Article  MathSciNet  MATH  Google Scholar 

  • Sung SC, Dimitrov D (2007) On myopic stability concepts for hedonic games. Theory Dec 62:31–45

    Article  MathSciNet  MATH  Google Scholar 

  • Suzuki A, Muto S (2000) Farsighted stability in prisoner’s dilemma. J Oper Res Soc Jpn 43:249–265

    Article  ADS  MathSciNet  MATH  Google Scholar 

  • Suzuki A, Muto S (2005) Farsighted stability in n-person prisoner’s dilemma. Int J Game Theory 33:431–445

    Article  MathSciNet  MATH  Google Scholar 

  • Suzuki A, Muto S (2006) Farsighted behavior leads to efficiency in duopoly markets. In: Haurie A et al (eds) Advances in dynamic games. Birkhauser, Boston, pp 379–395

    Chapter  MATH  Google Scholar 

  • Toda M (1997) Implementation and characterizations of the competitive solution with indivisibility. Mimeo

    Google Scholar 

  • von Neumann J, Morgenstern O (1953) Theory of games and economic behavior, 3rd edn. Princeton University Press, Princeton

    MATH  Google Scholar 

  • Wako J (1984) A note on the strong core of a market with indivisible goods. J Math Econ 13:189–194

    Article  MathSciNet  MATH  Google Scholar 

  • Wako J (1991) Some properties of weak domination in an exchange market with indivisible goods. Jpn Econ Rev 42:303–314

    Google Scholar 

  • Wako J (1999) Coalitional-proofness of the competitive allocations in an indivisible goods market. Fields Inst Commun 23:277–283

    MathSciNet  MATH  Google Scholar 

  • Wako J (2010) A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games. Algorithmica 58:188–220

    Article  MathSciNet  MATH  Google Scholar 

  • Xue L (1997) Nonemptiness of the largest consistent set. J Econ Theory 73:453–459

    Article  MathSciNet  MATH  Google Scholar 

  • Xue L (1998) Coalitional stability under perfect foresight. Econ Theory 11:603–627

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang J, Xue L, Zu L (2013) Farsighted free trade networks. Int J Game Theory 42:375–398

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work was supported by the Japan Society for the Promotion of Science (JSPS) Grant Numbers JP16H03121 and JP17K13696.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ryo Kawasaki .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media LLC

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Kawasaki, R., Wako, J., Muto, S. (2018). Cooperative Games (Von Neumann-Morgenstern Stable Sets). In: Meyers, R. (eds) Encyclopedia of Complexity and Systems Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27737-5_99-3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27737-5_99-3

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27737-5

  • Online ISBN: 978-3-642-27737-5

  • eBook Packages: Springer Reference Physics and AstronomyReference Module Physical and Materials ScienceReference Module Chemistry, Materials and Physics

Publish with us

Policies and ethics

Chapter history

  1. Latest

    Cooperative Games (Von Neumann-Morgenstern Stable Sets)
    Published:
    10 April 2018

    DOI: https://doi.org/10.1007/978-3-642-27737-5_99-3

  2. Original

    Cooperative Games (von Neumann–Morgenstern Stable Sets)
    Published:
    30 November 2015

    DOI: https://doi.org/10.1007/978-3-642-27737-5_99-2