Analysis of stochastic matching markets
Suppose that the agents of a matching market contact each other randomly and form new pairs if is in their interest. Does such a process always converge to a stable matching if one exists? If so, how quickly? Are some stable matchings more likely to be obtained by this process than others? In this paper we are going to provide answers to these and similar questions, posed by economists and computer scientists. In the first part of the paper we give an alternative proof for the theorems by Diamantoudi et al. and Inarra et al., which imply that the corresponding stochastic processes are absorbing Markov chains. The second part of the paper proposes new techniques to analyse the behaviour of matching markets. We introduce the Stable Marriage and Stable Roommates Automaton and show how the probabilistic model checking tool PRISM may be used to predict the outcomes of stochastic interactions between myopic agents. In particular, we demonstrate how one can calculate the probabilities of reaching different matchings in a decentralised market and determine the expected convergence time of the stochastic process concerned. We illustrate the usage of this technique by studying some well-known marriage and roommates instances and randomly generated instances. Copyright Springer-Verlag Berlin Heidelberg 2013
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 42 (2013)
Issue (Month): 4 (November)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00182/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.
- Larrea Jaurrieta, María Concepción & Iñarra García, María Elena & Molis Bañales, Elena, 2007.
"The Stability of the Roommate Problem Revisited,"
2007-30, Universidad del País Vasco - Departamento de Fundamentos del Análisis Económico I.
- Peter Biro & Flip Klijn, 2011.
"Matching with Couples: a Multidisciplinary Survey,"
IEHAS Discussion Papers
1139, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences.
- Bo Chen & Satoru Fujishige & Zaifu Yang, 2011.
"Decentralized Market Processes to Stable Job Matchings with Competitive Salaries,"
11/03, Department of Economics, University of York.
- Bo Chen & Satoru Fujishige & Zaifu Yang, 2010. "Decentralized Market Processes to Stable Job Matchings with Competitive Salaries," KIER Working Papers 749, Kyoto University, Institute of Economic Research.
- Bettina Klaus & Flip Klijn & Markus Walzl, 2008.
"Stochastic Stability for Roommate Markets,"
357, Barcelona Graduate School of Economics.
- Joana Pais & Agnes Pinter & Robert F. Veszteg, 2012. "Decentralized Matching Markets: A Laboratory Experiment," Working Papers Department of Economics 2012/08, ISEG - School of Economics and Management, Department of Economics, University of Lisbon.
- Fuhito Kojima & M. Ünver, 2008.
"Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration,"
International Journal of Game Theory,
Springer, vol. 36(3), pages 473-488, March.
- M.Utku Unver & Fuhito Kojima, 2006. "Random Paths to Pairwise Stability in Many-to-Many Matching Problems: A Study on Market Equilibration," Working Papers 256, University of Pittsburgh, Department of Economics, revised Jan 2006.
- László Á. Kóczy & Luc Lauwers, 2001.
"The Coalition Structure Core is Accessible,"
Game Theory and Information
0110001, EconWPA, revised 26 Jun 2002.
- Péter Biró & Katarína Cechlárová & Tamás Fleiner, 2008. "The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems," International Journal of Game Theory, Springer, vol. 36(3), pages 333-352, March.
- Blum, Yosef & Rothblum, Uriel G., 2002. ""Timing Is Everything" and Marital Bliss," Journal of Economic Theory, Elsevier, vol. 103(2), pages 429-443, April.
- E. Inarra & C. Larrea & E. Molis, 2008. "Random paths to P-stability in the roommate problem," International Journal of Game Theory, Springer, vol. 36(3), pages 461-471, March.
- Jinpeng Ma, 1996.
"On randomized matching mechanisms (*),"
Springer, vol. 8(2), pages 377-381.
- Suryapratim Banerjee & Hideo Konishi & Tayfun Sonmez, 1999.
"Core in a Simple Coalition Formation Game,"
Boston College Working Papers in Economics
449, Boston College Department of Economics.
- Bogomolnaia, Anna & Jackson, Matthew O., 2002. "The Stability of Hedonic Coalition Structures," Games and Economic Behavior, Elsevier, vol. 38(2), pages 201-230, February.
- James Boudreau, 2008.
"Preference Structure and Random Paths to Stability in Matching Markets,"
AccessEcon, vol. 3(67), pages 1-12.
- James W. Boudreau, 2008. "Preference Structure and Random Paths to Stability in Matching Markets," Working papers 2008-29, University of Connecticut, Department of Economics.
- Blum, Yosef & Roth, Alvin E. & Rothblum, Uriel G., 1997. "Vacancy Chains and Equilibration in Senior-Level Labor Markets," Journal of Economic Theory, Elsevier, vol. 76(2), pages 362-411, October.
When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:42:y:2013:i:4:p:1021-1040. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.