Analysis of stochastic matching markets

International Journal of Game Theory

Volumn 42, Issue 4, 2013, Pages 1021-1040

  Biró, Péter ^a   Norman, Gethin ^b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

Markov chain; Model checking; Path to stability; Stable matchings

Indexed keywords

EID: 84885911468     PISSN: 00207276     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00182-012-0352-8     Document Type: Article

References (49)

1. Ackermann H, Goldberg PW, Mirrokni V, Röglin H, Vöcking B (2008) Uncoordinated two-sided matching markets. In: Proceedings of 9th ACM Conference on Electronic Commerce (EC'08), Chicago, pp 256-263.
2. Aharoni R, Fleiner T (2003) On a lemma of Scarf. J Combin Theory B 87(1): 72-80 (Dedicated to Crispin St. Nash-Williams JA).
3. Arcaute E, Vassilvitskii S (2009) Social networks and stable matchings in the job market. In: Proceedings of 5th International Workshop on Internet and Network Economics (WINE'09), Rome, pp 220-231.
4. Banerjee S, Konishi H, Sönmez T (2001) Core in a simple coalition formation game. Soc Choice Welf 18: 135-153.
5. Béal S, Rémila E, Solal P (2011) On the number of blocks required to access the coalition structure core. Working paper, Munich Personal RePEc Archive, MPRA Paper No. 29755.
6. Biró P, Cechlárová K, Fleiner T (2008) The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems. Int J Game Theory 36: 333-352.
7. Biró P, Fleiner T (2010) Fractional solutions for NTU-games. In: Proceedings of 3rd Workshop on Computational Social Choice, Düsseldorf.
8. Biró P, Klijn F (2012) Matching with couples: a multidisciplinary survey. Int Game Theory Rev (to appear).
9. Biró P, Kern W, Paulusma D (2012a) Computing solutions for matching games. Int J Game Theory 41: 75-90.
10. Biró P, Bomhoff M, Golovach PA, Kern W, Paulusma D (2012b) Solutions for the stable roommates problem with payments. In: Proceedings of WG 2012: 38th International Workshop on Graph Theoretic Concepts in Computer Science (to appear).
11. Blum Y, Roth AE, Rothblum UG (1997) Vacancy chains and equilibration in senior-level labor markets. J Econ Theory 76: 362-411.
12. Blum Y, Rothblum UG (2002) Timing is everything and marital bliss. J Econ Theory 103: 429-443.
13. Bogomolnaia A, Jackson MO (2002) The stability of hedonic coalition structures. Games Econ Behav 38: 201-230.
14. Boudreau J (2008) Preference structure and random paths to stability in matching markets. Econ Bull 67: 1-12.
15. Boudreau J (2011) A note on the efficiency and fairness of decentralized matching. Oper Res Lett 39: 231-233.
16. Boudreau J (2012) An exploration into why some matchings are more likely than others. In: The proceedings of MATCH-UP 2012: The Second International Workshop on Matching Under Preferences, pp 39-50.
17. Chen B, Fujishige S, Yang Z (2011) Decentralized market processes to stable job matchings with competitive salaries. Working paper, Kyoto University, RIMS-1715.
18. Diamantoudi E, Miyagawa E, Xue L (2004) Random paths to stability in the roommates problem. Games Econ Behav 48: 18-28.
19. Echenique F, Yariv L (2011) An experimental study of decentralized matching. Working paper.
20. Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69: 9-15.
21. Gusfield D, Irving, RW (1989) The stable marriage problem: structure and algorithms. MIT Press, Cambridge.
22. Hoefer M (2011) Local matching dynamics in social networks. In: Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), LNCS 6756, Crete, pp 113-124.
23. Inarra E, Larrea C, Molis E (2008) Random paths to P-stability in the roommate problem. Int J Game Theory 36: 461-471.
24. Inarra E, Larrea C, Molis E (2008) The stability of the roommate problem revisited. In: Proceedings of Matching Under Preferences (MATCH-UP) Satellite Workshop of ICALP 2008, Reykjavik, pp 114-125.
25. Irving RW (1985) An efficient algorithm for the "stable roommates" problem. J Algorithms 6: 577-595.
26. Jackson MO, Watts A (2002) The evolution of social and economic networks. J Econ Theory 106(2): 265-295.
27. Kemeny JG, Snell JL (1960) Finite Markov chains. van Nostrand Company, Inc., New York.
28. Klaus B, Klijn F (2007a) Path to stability for matching markets with couples. Games Econ Behav 58: 154-171.
29. Klaus B, Klijn F (2007b) Corrigendum to on randomized matching mechanisms [Economic Theory 8(1996)377-381]. Economic Theory 32: 411-416.
30. Klaus B, Klijn F, Walzl M (2010) Stochastic stability for roommate markets. J Econ Theory 145: 2218-2240.
31. Knuth, DE (1976) Mariages stable et leurs relations avec d'autres problèmes combinatoires. Les Presses de l'Université de Montréal, Montréal.
32. Kóczy LÁ, Lauwers L (2004) The coalition structure core is accessible. Games Econ Behav 48: 86-93.
33. Kojima F, Ünver Ü (2008) Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration. Int J Game Theory 36: 473-488.
34. Kwiatkowska MZ, Norman G, Parker D (2004) Probabilistic Symbolic model checking with PRISM: a hybrid approach. Int J Softw Tools Technol Transf (STTT) 6(2): 128-142.
35. Kwiatkowska MZ, Norman G, Parker D (2011) PRISM 4. 0: verification of probabilistic real-time systems. In: Proceedings of 23th International Conference on Computer Aided Verification (CAV'11), vol 6806 of LNCS, Snowbird, pp 585-591.
36. Lebedev D, Mathieu F, Viennot L, Gai AT, Reynier J, de Montgolfier F (2007) On using matching theory to understand P2P network design. In: Proceedings of INOC 2007: International Network Optimization Conference, Washington DC, pp 1-6.
37. Ma J (1996) On randomized matching mechanisms. Econ Theory 8: 377-381.
38. Mathieu F (2010) Acyclic preference-based systems. In: Xuemin S, Heather Y, John B, Mursalin A (eds) Handbook of peer-to-per networking. Springer, Berlin.
39. Pais J, Pintér Á, Veszteg R (2011) Decentralized matching markets: a laboratory experiment. working paper.
40. Parker D (2002) Implementation of symbolic model checking for probabilistic systems. PhD thesis, University of Birmingham.
41. Roth AE, Sotomayor MAO (1990) Two-sided matching: a study in game-theoretic modeling and analysis. Econometric Society monographs, Cambridge.
42. Roth AE, Vande Vate JH (1990) Random paths to stability in two-sided matching. Econometrica 58: 1475-1480.
43. Scarf HE (1967) The core of an N person game. Econometrica 35: 50-69.
44. Tamura A (1993) Transformation from arbitrary matchings to stable matchings. J Comb Theory A 62: 310-323.
45. Tan JJ (1990) A maximum stable matching for the roommates problem. BIT Numer Math 30: 631-640.
46. Tan JJ (1991) A necessary and sufficient condition for the existence of a complete stable matching. J Algorithms 12: 154-178.
47. Tan JJ, Hsueh JC (1995) A generalisation of the stable matching problem. Discret Appl Math 59: 87-102.
48. Tan JJ, Su WC (1995) On the divorce digraph of the stable marriage problem. Proc Natl Sci Council 19: 342-354.
49. Yang Y-Y (2011) Accessible outcomes versus absorbing outcomes. Math Soc Sci 62: 65-70.