IDEAS home Printed from https://ideas.repec.org/p/fem/femwpa/2013.50.html
   My bibliography  Save this paper

The Evolution of Core Stability in Decentralized Matching Markets

Author

Listed:
  • Heinrich H. Nax

    (Paris School of Economics)

  • Bary S. R. Pradelski

    (University of Oxford, Oxford-Man Institute)

  • H. Peyton Young

    (University of Oxford)

Abstract

Decentralized matching markets on the internet allow large numbers of agents to interact anonymously at virtually no cost. Very little information is available to market participants and trade takes place at many different prices simultaneously. We propose a decentralized, completely uncoupled learning process in such environments that leads to stable and efficient outcomes. Agents on each side of the market make bids for potential partners and are matched if their bids are mutually profitable. Matched agents occasionally experiment with higher bids if on the buy-side (or lower bids if on the sell-side), while single agents, in the hope of attracting partners, lower their bids if on the buy-side (or raise their bids if on the sell-side). This simple and intuitive learning process implements core allocations even though agents have no knowledge of other agents' strategies, payoffs, or the structure of the game, and there is no central authority with such knowledge either.

Suggested Citation

  • Heinrich H. Nax & Bary S. R. Pradelski & H. Peyton Young, 2013. "The Evolution of Core Stability in Decentralized Matching Markets," Working Papers 2013.50, Fondazione Eni Enrico Mattei.
    • Handle: RePEc:fem:femwpa:2013.50
    as

    Download full text from publisher

    File URL: https://feem-media.s3.eu-central-1.amazonaws.com/wp-content/uploads/NDL2013-050.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Agastya, Murali, 1999. "Perturbed Adaptive Dynamics in Coalition Form Games," Journal of Economic Theory, Elsevier, vol. 89(2), pages 207-233, December.
    2. Crawford, Vincent P & Knoer, Elsie Marie, 1981. "Job Matching with Heterogeneous Firms and Workers," Econometrica, Econometric Society, vol. 49(2), pages 437-450, March.
    3. Demange, Gabrielle & Gale, David, 1985. "The Strategy Structure of Two-sided Matching Markets," Econometrica, Econometric Society, vol. 53(4), pages 873-888, July.
    4. Demange, Gabrielle & Gale, David & Sotomayor, Marilda, 1986. "Multi-Item Auctions," Journal of Political Economy, University of Chicago Press, vol. 94(4), pages 863-872, August.
    5. Murali Agastya, 1997. "Adaptive Play in Multiplayer Bargaining Situations," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 64(3), pages 411-426.
    6. Kareen Rozen, 2008. "Conflict Leads to Cooperation in Nash Bargaining," Cowles Foundation Discussion Papers 1641, Cowles Foundation for Research in Economics, Yale University, revised Jun 2009.
    7. Germano, Fabrizio & Lugosi, Gabor, 2007. "Global Nash convergence of Foster and Young's regret testing," Games and Economic Behavior, Elsevier, vol. 60(1), pages 135-154, July.
    8. Roth, Alvin E, 1984. "The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory," Journal of Political Economy, University of Chicago Press, vol. 92(6), pages 991-1016, December.
    9. Sotomayor, Marilda, 2003. "Some further remark on the core structure of the assignment game," Mathematical Social Sciences, Elsevier, vol. 46(3), pages 261-265, December.
    10. Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
    11. Young, H. Peyton, 2009. "Learning by trial and error," Games and Economic Behavior, Elsevier, vol. 65(2), pages 626-643, March.
    12. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    13. Karandikar, Rajeeva & Mookherjee, Dilip & Ray, Debraj & Vega-Redondo, Fernando, 1998. "Evolving Aspirations and Cooperation," Journal of Economic Theory, Elsevier, vol. 80(2), pages 292-331, June.
    14. Sawa, Ryoji, 2014. "Coalitional stochastic stability in games, networks and markets," Games and Economic Behavior, Elsevier, vol. 88(C), pages 90-111.
    15. M. L. Balinski, 1965. "Integer Programming: Methods, Uses, Computations," Management Science, INFORMS, vol. 12(3), pages 253-313, November.
    16. , P. & , Peyton, 2006. "Regret testing: learning to play Nash equilibrium without knowing you have an opponent," Theoretical Economics, Econometric Society, vol. 1(3), pages 341-367, September.
    17. Sergiu Hart & Andreu Mas-Colell, 2013. "Uncoupled Dynamics Do Not Lead To Nash Equilibrium," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 7, pages 153-163, World Scientific Publishing Co. Pte. Ltd..
    18. Arnold, Tone & Schwalbe, Ulrich, 2002. "Dynamic coalition formation and the core," Journal of Economic Behavior & Organization, Elsevier, vol. 49(3), pages 363-380, November.
    19. Newton, Jonathan, 2012. "Recontracting and stochastic stability in cooperative games," Journal of Economic Theory, Elsevier, vol. 147(1), pages 364-381.
    20. Elliott Peranson & Alvin E. Roth, 1999. "The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design," American Economic Review, American Economic Association, vol. 89(4), pages 748-780, September.
    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. 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.

    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. 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.
    2. Heinrich H. Nax & Bary S.R. Pradelski, 2012. "Evolutionary dynamics and equitable core selection in assignment games," Economics Series Working Papers 607, University of Oxford, Department of Economics.
    3. 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.
    4. Jonathan Newton, 2018. "Evolutionary Game Theory: A Renaissance," Games, MDPI, vol. 9(2), pages 1-67, May.
    5. Bary S.R. Pradelski, 2014. "Evolutionary Dynamics and Fast Convergence in the Assignment Game," Economics Series Working Papers 700, University of Oxford, Department of Economics.
    6. 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.
    7. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    8. Mäs, Michael & Nax, Heinrich H., 2016. "A behavioral study of “noise” in coordination games," LSE Research Online Documents on Economics 65422, London School of Economics and Political Science, LSE Library.
    9. Sawa, Ryoji, 2019. "Stochastic stability under logit choice in coalitional bargaining problems," Games and Economic Behavior, Elsevier, vol. 113(C), pages 633-650.
    10. Mäs, Michael & Nax, Heinrich H., 2016. "A behavioral study of “noise” in coordination games," Journal of Economic Theory, Elsevier, vol. 162(C), pages 195-208.
    11. Klaus, Bettina & Newton, Jonathan, 2016. "Stochastic stability in assignment problems," Journal of Mathematical Economics, Elsevier, vol. 62(C), pages 62-74.
    12. Jagadeesan, Ravi & Kominers, Scott Duke & Rheingans-Yoo, Ross, 2018. "Strategy-proofness of worker-optimal matching with continuously transferable utility," Games and Economic Behavior, Elsevier, vol. 108(C), pages 287-294.
    13. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    14. Marco LiCalzi, 2022. "Bipartite choices," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 45(2), pages 551-568, December.
    15. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    16. 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.
    17. Committee, Nobel Prize, 2012. "Alvin E. Roth and Lloyd S. Shapley: Stable allocations and the practice of market design," Nobel Prize in Economics documents 2012-1, Nobel Prize Committee.
    18. Bettina Klaus & Frédéric Payot, 2013. "Paths to Stability in the Assignment Problem," Cahiers de Recherches Economiques du Département d'économie 13.14, Université de Lausanne, Faculté des HEC, Département d’économie.
    19. David Pérez-Castrillo & Marilda Sotomayor, 2017. "On the manipulability of competitive equilibrium rules in many-to-many buyer–seller markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(4), pages 1137-1161, November.
    20. Sotomayor, Marilda, 2007. "Connecting the cooperative and competitive structures of the multiple-partners assignment game," Journal of Economic Theory, Elsevier, vol. 134(1), pages 155-174, May.

    More about this item

    Keywords

    Assignment Games; Cooperative Games; Core; Evolutionary Game Theory; Learning; Matching Markets;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search; Learning; Information and Knowledge; Communication; Belief; Unawareness

    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:fem:femwpa:2013.50. 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: Alberto Prina Cerai (email available below). General contact details of provider: https://edirc.repec.org/data/feemmit.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.