Social Choice and Welfare

, Volume 39, Issue 2–3, pp 521–536

The partnered core of a game with side payments

Article

Abstract

An outcome of a game is partnered if there are no asymmetric dependencies between any two players. For a cooperative game, a payoff is in the partnered core of the game if it is partnered, feasible and cannot be improved upon by any coalition of players. We show that the relative interior of the core of a game with side payments is contained in the partnered core. For quasi-strictly convex games the partnered core coincides with the relative interior of the core. When there are no more than three partnerships, the sums of the payoffs to partnerships are constant across all core payoffs. When there are no more than three players, the partnered core satisfies additional properties. We also illustrate our main result for coalition structure games.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albers W (1974) Zwei Logungskonzepte Fur Kooperative Mehrpersonspiele, Die Auf Anspruchsniveaus der Spieler Bastiern. OR-Verfahren (Meth Oper Res) 21: 1–13Google Scholar
  2. Albers W (1979) Core and Kernel variants based on imputations and demand profiles. In: Moeschlin O, Pallaschke D (eds) Game theory and related topics. North Holland, AmsterdamGoogle Scholar
  3. Aumann RJ, Dreze J (1974) Cooperative games with coalition structures. Int J Game Theory 3: 217–237CrossRefGoogle Scholar
  4. Bennett E (1980) Coalition formation and payoff distribution in cooperative games. Ph.D. Dissertation, Northwestern UniversityGoogle Scholar
  5. Bennett E (1983) The aspiration approach to predicting coalition formation and payoff distribution in sidepayment games. Int J Game Theory 12: 1–28CrossRefGoogle Scholar
  6. Bennett E, Zame WR (1988) Bargaining in cooperative games. Int J Game Theory 17: 279–300CrossRefGoogle Scholar
  7. Bondareva O (1963) Some applications of linear programming methods to the theory of cooperative games. Problemy Kybernetiki 10: 119–139 (in Russian)Google Scholar
  8. Dutta B, Mutuswami S (1997) Stable networks. J Econ Theory 76: 322–344CrossRefGoogle Scholar
  9. Dutta B, Ray D (1989) A concept of egalitarianism under participation constraint. Econometrica 57: 615–635CrossRefGoogle Scholar
  10. Dutta B, van den Nouweland A, Tijs S (1998) Link formation in cooperative situations. Int J Game Theory 27: 245–256CrossRefGoogle Scholar
  11. Jackson M, van den Nouweland A. (2005) Strongly stable networks. Games Econ Behav 51(2): 420–444CrossRefGoogle Scholar
  12. Kaneko M, Wooders MH (1982) Cores of partitioning games. Math Soc Sci 3: 313–327CrossRefGoogle Scholar
  13. Kannai Y, Wooders M (2000) A further extension of the KKMS theorem. Math Oper Res 25: 539–551CrossRefGoogle Scholar
  14. le Breton M, Owen G, Weber S (1992) Strongly balanced cooperative games. Int J Game Theory 20: 419–427CrossRefGoogle Scholar
  15. Maschler M, Peleg B (1966) A characterization, existence proof and dimension bounds for the Kernel of a game. Pacific J Math 18: 289–328Google Scholar
  16. Maschler M, Peleg B (1967) The structure of the Kernel of a cooperative game. SIAM J Appl Math 15: 569–604CrossRefGoogle Scholar
  17. Maschler M, Peleg B, Shapley LS (1971) The kernel and bargaining set for convex games. Int J Game Theory 1: 73–93CrossRefGoogle Scholar
  18. Moldovanu B, Winter E (1994) Consistent demands for coalition formation in games. In: Nimrod Megiddo (eds) Essays in game theory in honor of Michael. Springer, Maschler, pp 129–140CrossRefGoogle Scholar
  19. Owen G (1982) Game theory. Academic Press, New YorkGoogle Scholar
  20. Page FH Jr, Wooders M (1996) The partnered core and the partnered competitive equilibrium. Econ Lett 52: 143–152CrossRefGoogle Scholar
  21. Peleg B (1968) On minimal separating collections. Proc Am Math Soc 19: 1–3CrossRefGoogle Scholar
  22. Ray D (1989) Credible coalitions and the core. Int J Game Theory 18: 185–187CrossRefGoogle Scholar
  23. Reny PJ, Wooders M (1996) The partnered core of a game without side payments. J Econ Theory 70: 298–311CrossRefGoogle Scholar
  24. Reny PJ, Wooders M (1998) An extension of the KKMS theorem. J Math Econ 29: 125–134CrossRefGoogle Scholar
  25. Reny PJ, Winter E, Wooders M (1993) The partnered core of a game with side payments. Hebrew University Center for Rationality Working Paper 33; University of Bonn Sonderforschungsbereich 303, in the German National Library, OCLC 7551219; 1 University of Western Ontario Research Report ISBN 0771415893Google Scholar
  26. Rockafellar RT (1970) Convex analysis. Princeton University Press, PrincetonGoogle Scholar
  27. Scarf HE (1967) The core of an n-person game. Econometrica 35: 50–67CrossRefGoogle Scholar
  28. Schrijver A (1990) Theory of linear and integer programming. Wiley Interscience Series in Discrete Mathematics and Optimization, LondonGoogle Scholar
  29. Selten R (1981) A noncooperative model of characteristic function bargaining. In: Boehm V, Nacktkamp H (eds) Essays in game theory and mathematical economics in honor of Oskar Morgenstern. In: Gesellschaft, Recht, Wirtschaft, Band 4, Wissenschaftsverlag Bibliographisches Institute. Mannheim-Wein-Zurich, pp 131–151Google Scholar
  30. Shapley LS (1967) On balanced sets and cores. Navel Res Log Quar 14: 460–463Google Scholar
  31. von Neumann J, Morgenstern O (1953) The theory of games. Princeton University Press, PrincetonGoogle Scholar
  32. Winter E (1989) An axiomatization of the stable and semistable demand vectors by the reduced game property. Discussion Paper No. A-254, The University of BonnGoogle Scholar
  33. Wooders M, Page F (2008) Coalitions. In: Durlauf S, Blume L (eds) The new Palgrave dictionary of economics, 2nd edn. Palgrave McMillan, BasingstokeGoogle Scholar

Copyright information

© Springer-Verlag 2012

Authors and Affiliations

  1. 1.University of ChicagoChicagoUSA
  2. 2.Hebrew UniversityJerusalemIsrael
  3. 3.Vanderbilt UniversityNashvilleUSA

Personalised recommendations