Advertisement

International Journal of Game Theory

, Volume 36, Issue 3–4, pp 409–420 | Cite as

Instability of matchings in decentralized markets with various preference structures

  • Kimmo ErikssonEmail author
  • Olle Häggström
Original Paper

Abstract

In any two-sided matching market, a stable matching can be found by a central agency using the deferred acceptance procedure of Gale and Shapley. But if the market is decentralized and information is incomplete then stability of the ensuing matching is not to be expected. Despite the prevalence of such matching situations, and the importance of stability, little theory exists concerning instability. We discuss various measures of instability and analyze how they interact with the structure of the underlying preferences. Our main result is that even the outcome of decentralized matching with incomplete information can be expected to be “almost stable” under reasonable assumptions.

Keywords

Stable matching Blocking pair Instability Preference structure Decentralized market Maximin matching 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abraham D, Biró P, Manlove DF (2006) “Almost stable” matchings in the roommates problem. In: Proceedings of WAOA 2005. Springer Lecture Notes in Computer Science, vol 3879. pp 1–14Google Scholar
  2. Alpern S, Reyniers D (1999) Strategic mating with homotypic preferences. J Theor Biol 198:71–88CrossRefGoogle Scholar
  3. Alpern S, Reyniers D (2005) Strategic mating with common preferences. J Theor Biol 237:337–354CrossRefGoogle Scholar
  4. Bergstrom CT, Real LA (2000) Towards a theory of mutual mate choice: Lessons from two-sided matching. Evol Ecol Res 2:493–508Google Scholar
  5. Eriksson K, Strimling P (2005) How unstable are matchings from decentralized mate search?. unpublished manuscriptGoogle Scholar
  6. Eriksson K, Sjöstrand J, Strimling P (2007) Optimal expected rank in a two-sided secretary problem. Oper Res (to appear)Google Scholar
  7. Gale D, Shapley L (1962) College admissions and the stability of marriage. Am Math Mon 69:9–15CrossRefGoogle Scholar
  8. Gusfield D, Irving RW (1989) The stable marriage problem: Structure and algorithms. MIT Press, CambridgeGoogle Scholar
  9. Kagel JH, Roth AE (2000) The dynamics of reorganization in matching markets: A laboratory experiment motivated by a natural experiment. Quart J Econ 115:201–235CrossRefGoogle Scholar
  10. Kalick SM, Hamilton TE (1986) The matching hypothesis reexamined. J Personality Soc Pscyhol 51(4):673–682CrossRefGoogle Scholar
  11. Niederle M, Roth AE (2006) Making markets thick: How norms governing exploding offers affect market performance. preprintGoogle Scholar
  12. Pittel B (1989) The average number of stable matchings. SIAM J Discrete Math 2:530–549CrossRefGoogle Scholar
  13. Roth AE, Sotomayor MAO (1990) Two-sided matching. Cambridge University Press, CambridgeGoogle Scholar
  14. Roth AE, Xing X (1997) Turnaround time and bottlenecks in market clearing: Decentralized matching in the market for clinical psychologists. J Polit Econ 105:284–329CrossRefGoogle Scholar
  15. Simão J, Todd PM (2002) Modeling mate choice in monogamous mating systems with courtship. Adaptive Behav 10(2):113–136CrossRefGoogle Scholar
  16. Todd PM, Miller GF (1999) From pride and prejudice to persuasion: Satisficing in mate search. In: Gigerenzer G, Todd PM (eds). Simple heuristics that make us smart. Oxford University Press, Oxford, pp 287–308Google Scholar
  17. Ünver MU (2005) On the survival of some unstable two-sided matching mechanisms. Int J Game Theory 33(2):239–254CrossRefGoogle Scholar

Copyright information

© Springer Verlag 2007

Authors and Affiliations

  1. 1.Mälardalen University, IMAVästeråsSweden
  2. 2.Chalmers University of TechnologyGoteborgSweden

Personalised recommendations