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://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/182/PS2|
References listed on IDEAS
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.:
- Bogomolnaia, Anna & Jackson, Matthew O., 2002. "The Stability of Hedonic Coalition Structures," Games and Economic Behavior, Elsevier, vol. 38(2), pages 201-230, February.
- 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.
- Bettina Klaus & Flip Klijn & Markus Walzl, 2008.
"Stochastic Stability for Roommate Markets,"
357, Barcelona Graduate School of Economics.
- Blum, Yosef & Rothblum, Uriel G., 2002. ""Timing Is Everything" and Marital Bliss," Journal of Economic Theory, Elsevier, vol. 103(2), pages 429-443, April.
- 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.
- 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.
- 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.
- Koczy, Laszlo A. & Lauwers, Luc, 2004.
"The coalition structure core is accessible,"
Games and Economic Behavior,
Elsevier, vol. 48(1), pages 86-93, July.
- László Á. Kóczy & Luc Lauwers, 2002. "The Coalition Structure Core is Accessible," Working Papers Department of Economics ces0219, KU Leuven, Faculty of Economics and Business, Department of Economics.
- László Á. Kóczy & Luc Lauwers, 2001. "The Coalition Structure Core is Accessible," Game Theory and Information 0110001, EconWPA, revised 26 Jun 2002.
- Ma, Jinpeng, 1996.
"On Randomized Matching Mechanisms,"
Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(2), pages 377-81, August.
- E. Inarra & C. Larrea & E. Molis, 2008. "Random paths to P-stability in the roommate problem," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 461-471, March.
- Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.
- 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.
- INARRA, Elena & LARREA, Conchi & MOLIS, Elena, 2010.
"The stability of the roommate problem revisited,"
CORE Discussion Papers
2010007, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- 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;Game Theory Society, vol. 36(3), pages 473-488, March.
- 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;Game Theory Society, vol. 36(3), pages 333-352, March.
- James W. Boudreau, 2008.
"Preference Structure and Random Paths to Stability in Matching Markets,"
2008-29, University of Connecticut, Department of Economics.
- James Boudreau, 2008. "Preference Structure and Random Paths to Stability in Matching Markets," Economics Bulletin, AccessEcon, vol. 3(67), pages 1-12.
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 (Rebekah McClure)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.