Advertisement

Social Choice and Welfare

, Volume 53, Issue 4, pp 557–573 | Cite as

Monotonic core allocation paths for assignment games

  • Takaaki AbeEmail author
  • Shuige Liu
Original Paper
  • 152 Downloads

Abstract

We introduce a modification of Sprumont (Games Econ Behav 2:378–394, 1990) population monotonic allocation scheme (PMAS), called monotonic core allocation path (MCAP) for assignment games, which is a sequence of allocations along an order on the set of players satisfying that (1) each allocation is in the core of the subgame of the corresponding players at that step, and (2) the payoffs for each player are non-decreasing through the sequence. The notion of MCAP preserves the population monotonicity of PMAS while avoids the difficulty that PMAS does not exist in many market games. We show that for every assignment game, there is an order of players along which a MCAP exists. The terminals of MCAP form a refinement of the core. We also show that the terminals of MCAP coincide with the extreme core allocations in two subclasses of assignment games: gloves games and Böhm-Bawerk games. The strong connection of MCAP with extreme core allocations suggests some conflict between the stability of a coalition formation process and the fairness of the resulting outcomes.

Notes

References

  1. Bondareva O (1963) Some applications of linear programming methods to the theory of cooperative games. Problemi Kobernet 10:119–139 (In Russian)Google Scholar
  2. Chambers C, Hayashi T (2017) Can everyone benefit from economic integration? Working paper. https://sites.google.com/site/tkshhysh/. Accessed 20 Feb 2019
  3. Diestel R (2017) Graph theory, 5th edn. Springer, BerlinCrossRefGoogle Scholar
  4. Dutta B, Ray D (1989) A concept of egalitarianism under participation constraints. Econometrica 56:615–635CrossRefGoogle Scholar
  5. Hammers H, Klijn F, Solymosi T, Tijs F, Villar JP (2002) Assignment games satisfy the CoMa-property. Games Behav 38:231–239CrossRefGoogle Scholar
  6. Izquierdo J, Núñez M, Rafels C (2007) A simple procedure to obtain the extreme core allocations of an assignment market. Int J Game Theory 36:17–26CrossRefGoogle Scholar
  7. Moulin H (1995) Cooperative microeconomics: a game-theoretic introduction. Princeton University Press, PrincetonCrossRefGoogle Scholar
  8. Núñez M, Rafels C (2003) Characterization of the extreme core allocations of the assignment game. Games Econ Behav 44:311–331CrossRefGoogle Scholar
  9. Ortega J (2018) Social integration in two-sided matching markets. J Math Econ 78:119–226CrossRefGoogle Scholar
  10. Shapley L (1967) On balanced sets and cores. Nav Res Logist 14:453–460CrossRefGoogle Scholar
  11. Shapley L, Shubik M (1969) On market games. J Econ Theory 1:9–25CrossRefGoogle Scholar
  12. Shapley L, Shubik M (1971) The assignment game. I. The core. Int J Game Theory 1:111–130CrossRefGoogle Scholar
  13. Sprumont Y (1990) Population monotonic allocation schemes for cooperative games with transferable utility. Games Econ Behav 2:378–394CrossRefGoogle Scholar
  14. Tejada O, Alvarez-Mozos M (2016) Vertical syndication-proof competitive prices in multilateral assignment markets. Rev Econ Des 20:289–327Google Scholar
  15. Thomson W (1983) The fair devision of a fixed supply among a growing population. Math Oper Res 8:319–326CrossRefGoogle Scholar
  16. Thomson W (1983) Problems of fair division and the egalitarian solution. J Econ Theory 31:211–226CrossRefGoogle Scholar
  17. Toda M (2006) Monotonicity and consistency in matching markets. Int J Game Theory 34:13CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.School of Political Science and EconomicsWaseda UniversityTokyoJapan
  2. 2.EPICENTERMaastricht UniversityMaastrichtThe Netherlands

Personalised recommendations