IDEAS home Printed from https://ideas.repec.org/p/has/discpr/1132.html
   My bibliography  Save this paper

Analysis of Stochastic Matching Markets

Author

Listed:
  • Peter Biro

    (Institute of Economics - Hungarian Academy of Sciences)

  • Gethin Norman

    (School of Computing Science - University of Glasgow)

Abstract

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 implies that the corresponding stochastic processes are absorbing Markov chains. Our proof is not only shorter, but also provides upper bounds for the number of steps needed to stabilise the system. 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.

Suggested Citation

  • Peter Biro & Gethin Norman, 2011. "Analysis of Stochastic Matching Markets," CERS-IE WORKING PAPERS 1132, Institute of Economics, Centre for Economic and Regional Studies.
  • Handle: RePEc:has:discpr:1132
    as

    Download full text from publisher

    File URL: http://econ.core.hu/file/download/mtdp/MTDP1132.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    2. James Boudreau, 2008. "Preference Structure and Random Paths to Stability in Matching Markets," Economics Bulletin, AccessEcon, vol. 3(67), pages 1-12.
    3. Klaus, Bettina & Klijn, Flip & Walzl, Markus, 2010. "Stochastic stability for roommate markets," Journal of Economic Theory, Elsevier, vol. 145(6), pages 2218-2240, November.
    4. 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.
    5. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2011. "On the number of blocks required to access the coalition structure core," MPRA Paper 29755, University Library of Munich, Germany.
    6. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2010. "On the number of blocks required to access the core," MPRA Paper 26578, University Library of Munich, Germany.
    7. Jinpeng Ma, 1996. "On randomized matching mechanisms (*)," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(2), pages 377-381.
    8. Koczy, Laszlo A. & Lauwers, Luc, 2004. "The coalition structure core is accessible," Games and Economic Behavior, Elsevier, vol. 48(1), pages 86-93, July.
    9. Blum, Yosef & Rothblum, Uriel G., 2002. ""Timing Is Everything" and Marital Bliss," Journal of Economic Theory, Elsevier, vol. 103(2), pages 429-443, April.
    10. Iñarra García, María Elena & Larrea Jaurrieta, María Concepción & Molis Bañales, Elena, 2007. "The Stability of the Roommate Problem Revisited," IKERLANAK 2007-30, Universidad del País Vasco - Departamento de Fundamentos del Análisis Económico I.
    11. Joana Pais & Agnes Pinter & Robert F. Veszteg, 2012. "Decentralized Matching Markets: A Laboratory Experiment," Working Papers Department of Economics 2012/08, ISEG - Lisbon School of Economics and Management, Department of Economics, Universidade de Lisboa.
    12. Peter Biro & Matthijs Bomhoff & Walter Kern & Petr A. Golovach & Daniel Paulusma, 2012. "Solutions for the Stable Roommates Problem with Payments," CERS-IE WORKING PAPERS 1211, Institute of Economics, Centre for Economic and Regional Studies.
    13. Roth, Alvin E & Vande Vate, John H, 1990. "Random Paths to Stability in Two-Sided Matching," Econometrica, Econometric Society, vol. 58(6), pages 1475-1480, November.
    14. Jackson, Matthew O. & Watts, Alison, 2002. "The Evolution of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 106(2), pages 265-295, October.
    15. Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.
    16. Bogomolnaia, Anna & Jackson, Matthew O., 2002. "The Stability of Hedonic Coalition Structures," Games and Economic Behavior, Elsevier, vol. 38(2), pages 201-230, February.
    17. Tayfun Sönmez & Suryapratim Banerjee & Hideo Konishi, 2001. "Core in a simple coalition formation game," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 18(1), pages 135-153.
    18. 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.
    19. 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.
    20. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jacob D Leshno & Bary S R Pradelski, 2021. "The importance of memory for price discovery in decentralized markets," Post-Print hal-03100097, HAL.
    2. Bolle Friedel & Otto Philipp E., 2016. "Matching as a Stochastic Process," Journal of Economics and Statistics (Jahrbuecher fuer Nationaloekonomie und Statistik), De Gruyter, vol. 236(3), pages 323-348, May.
    3. Newton, Jonathan & Sawa, Ryoji, 2015. "A one-shot deviation principle for stability in matching problems," Journal of Economic Theory, Elsevier, vol. 157(C), pages 1-27.
    4. Leshno, Jacob D. & Pradelski, Bary S.R., 2021. "The importance of memory for price discovery in decentralized markets," Games and Economic Behavior, Elsevier, vol. 125(C), pages 62-78.
    5. Joana Pais & Ágnes Pintér & Róbert F. Veszteg, 2020. "Decentralized matching markets with(out) frictions: a laboratory experiment," Experimental Economics, Springer;Economic Science Association, vol. 23(1), pages 212-239, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Klaus, Bettina & Klijn, Flip & Walzl, Markus, 2010. "Stochastic stability for roommate markets," Journal of Economic Theory, Elsevier, vol. 145(6), pages 2218-2240, November.
    2. Newton, Jonathan & Sawa, Ryoji, 2015. "A one-shot deviation principle for stability in matching problems," Journal of Economic Theory, Elsevier, vol. 157(C), pages 1-27.
    3. Heinrich Nax & Bary Pradelski, 2015. "Evolutionary dynamics and equitable core selection in assignment games," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(4), pages 903-932, November.
    4. Nax, Heinrich H. & Pradelski, Bary S. R., 2015. "Evolutionary dynamics and equitable core selection in assignment games," LSE Research Online Documents on Economics 65428, London School of Economics and Political Science, LSE Library.
    5. Mauleon, Ana & Roehl, Nils & Vannetelbosch, Vincent, 2019. "Paths to stability for overlapping group structures," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 19-24.
    6. Ana Mauleon & Nils Roehl & Vincent Vannetelbosch, 2014. "Constitutions and Social Networks," Working Papers CIE 74, Paderborn University, CIE Center for International Economics.
    7. Bando, Keisuke & Kawasaki, Ryo, 2021. "Stability properties of the core in a generalized assignment problem," Games and Economic Behavior, Elsevier, vol. 130(C), pages 211-223.
    8. Emiliya Lazarova & Dinko Dimitrov, 2017. "Paths to stability in two-sided matching under uncertainty," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(1), pages 29-49, March.
    9. Mauleon, Ana & Roehl, Nils & Vannetelbosch, Vincent, 2018. "Constitutions and groups," Games and Economic Behavior, Elsevier, vol. 107(C), pages 135-152.
    10. Jonathan Newton, 2018. "Evolutionary Game Theory: A Renaissance," Games, MDPI, vol. 9(2), pages 1-67, May.
    11. Peter Biro & Elena Iñarra & Elena Molis, 2014. "A new solution for the roommate problem. The Q-stable matchings," ThE Papers 14/04, Department of Economic Theory and Economic History of the University of Granada..
    12. Herings, P. Jean-Jacques & Kóczy, László Á., 2021. "The equivalence of the minimal dominant set and the myopic stable set for coalition function form games," Games and Economic Behavior, Elsevier, vol. 127(C), pages 67-79.
    13. Heinrich H. Nax & Bary S. R. Pradelski, 2016. "Core Stability and Core Selection in a Decentralized Labor Matching Market," Games, MDPI, vol. 7(2), pages 1-16, March.
    14. Biró, Péter & Iñarra, Elena & Molis, Elena, 2016. "A new solution concept for the roommate problem: Q-stable matchings," Mathematical Social Sciences, Elsevier, vol. 79(C), pages 74-82.
    15. Klaus, Bettina & Newton, Jonathan, 2016. "Stochastic stability in assignment problems," Journal of Mathematical Economics, Elsevier, vol. 62(C), pages 62-74.
    16. Ágnes Cseh & Martin Skutella, 2019. "Paths to stable allocations," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(3), pages 835-862, September.
    17. Piotr Dworczak, 2021. "Deferred Acceptance with Compensation Chains," Operations Research, INFORMS, vol. 69(2), pages 456-468, March.
    18. Diamantoudi, Effrosyni & Miyagawa, Eiichi & Xue, Licun, 2004. "Random paths to stability in the roommate problem," Games and Economic Behavior, Elsevier, vol. 48(1), pages 18-28, July.
    19. Bettina Klaus & Flip Klijn & Markus Walzl, 2011. "Farsighted Stability for Roommate Markets," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 13(6), pages 921-933, December.
    20. Elette Boyle & Federico Echenique, 2009. "Sequential entry in many-to-one matching markets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 33(1), pages 87-99, June.

    More about this item

    Keywords

    roommates problem; marriage problem; stochastic processes; core convergence; probabilistic model checking;
    All these keywords.

    JEL classification:

    • C62 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Existence and Stability Conditions of Equilibrium
    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:has:discpr:1132. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Nora Horvath (email available below). General contact details of provider: https://edirc.repec.org/data/iehashu.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.