IDEAS home Printed from https://ideas.repec.org/a/the/publsh/3088.html
   My bibliography  Save this article

Learning by matching

Author

Listed:
  • Chen, Yi-Chun

    (Department of Economics, National University of Singapore)

  • Hu, Gaoji

    (School of Economics, Shanghai University of Finance and Economics)

Abstract

This paper studies a stability notion and matching processes in the job market with incomplete information on the workers' side. Each worker is associated with a type, and each firm cares about the type of her employee under a match. Moreover, firms' information structure is described by partitions over possible worker type profiles. With this firm-specific information, we propose a stability notion which, in addition to requiring individual rationality and no blocking pairs, captures the idea that the absence of rematching conveys no further information. When an allocation is not stable under the status quo information structure, a new pair of an allocation and an information structure will be derived. We show that starting from an arbitrary allocation and an arbitrary information structure, the process of allowing randomly chosen blocking pairs to rematch, accompanied by information updating, will converge with probability one to an allocation that is stable under the updated information structure. Our results are robust with respect to various alternative learning patterns.

Suggested Citation

  • Chen, Yi-Chun & Hu, Gaoji, 2020. "Learning by matching," Theoretical Economics, Econometric Society, vol. 15(1), January.
    • Handle: RePEc:the:publsh:3088
    as

    Download full text from publisher

    File URL: http://econtheory.org/ojs/index.php/te/article/viewFile/20200029/26178/747
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Lauermann, Stephan & Nöldeke, Georg, 2014. "Stable marriages and search frictions," Journal of Economic Theory, Elsevier, vol. 151(C), pages 163-195.
    2. George J. Mailath & Andrew Postlewaite & Larry Samuelson, 2017. "Premuneration Values and Investments in Matching Markets," Economic Journal, Royal Economic Society, vol. 127(604), pages 2041-2065, September.
    3. 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.
    4. 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.
    5. 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.
    6. Ma, Jinpeng, 1996. "On Randomized Matching Mechanisms," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(2), pages 377-381, August.
    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. Chen, Yi-Chun & Hu, Gaoji, 2024. "Bayesian stable states," Games and Economic Behavior, Elsevier, vol. 145(C), pages 102-116.
    2. Fuchao Yu & Xianchao Xiu & Yunhui Li, 2022. "A Survey on Deep Transfer Learning and Beyond," Mathematics, MDPI, vol. 10(19), pages 1-27, October.
    3. Peralta, Esteban, 2024. "Not all is lost: Sorting and self-stabilizing sets," Games and Economic Behavior, Elsevier, vol. 146(C), pages 51-58.
    4. Wang, Fujin & Zhao, Zhibin & Zhai, Zhi & Guo, Yanjie & Xi, Huan & Wang, Shibin & Chen, Xuefeng, 2023. "Feature disentanglement and tendency retainment with domain adaptation for Lithium-ion battery capacity estimation," Reliability Engineering and System Safety, Elsevier, vol. 230(C).
    5. Kenny Peng & Nikhil Garg, 2024. "Wisdom and Foolishness of Noisy Matching Markets," Papers 2402.16771, arXiv.org.

    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. 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.
    2. Alston, Max, 2020. "On the non-existence of stable matches with incomplete information," Games and Economic Behavior, Elsevier, vol. 120(C), pages 336-344.
    3. Péter Biró & Gethin Norman, 2013. "Analysis of stochastic matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(4), pages 1021-1040, November.
    4. Satoru Fujishige & Zaifu Yang, 2017. "On a spontaneous decentralized market process," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 1-37, December.
    5. Bettina Klaus & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'économie 14.07, Université de Lausanne, Faculté des HEC, Département d’économie.
    6. Vinay Ramani & K. S. Mallikarjuna Rao, 2018. "Paths to stability and uniqueness in two-sided matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(4), pages 1137-1150, November.
    7. Muriel Niederle & Alvin E. Roth, 2009. "The Effects of a Centralized Clearinghouse on Job Placement, Wages, and Hiring Practices," NBER Chapters, in: Studies of Labor Market Intermediation, pages 235-271, National Bureau of Economic Research, Inc.
    8. Itai Ashlagi & Flip Klijn, 2012. "Manipulability in matching markets: conflict and coincidence of interests," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(1), pages 23-33, June.
    9. Yokote, Koji, 2021. "Consistency of the doctor-optimal equilibrium price vector in job-matching markets," Journal of Economic Theory, Elsevier, vol. 197(C).
    10. Jiang, Zhishan & Tian, Guoqiang, 2013. "Matching with Couples: Stability and Algorithm," MPRA Paper 57936, University Library of Munich, Germany, revised Jul 2014.
    11. Marianne Bertrand & Emir Kamenica & Jessica Pan, 2015. "Gender Identity and Relative Income within Households," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 130(2), pages 571-614.
    12. Kirill Rudov, 2024. "Fragile Stable Matchings," Papers 2403.12183, arXiv.org.
    13. 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.
    14. James Boudreau & Vicki Knoblauch, 2013. "Preferences and the price of stability in matching markets," Theory and Decision, Springer, vol. 74(4), pages 565-589, April.
    15. Bettina Klaus & Flip Klijn, 2007. "Corrigendum to “On randomized matching mechanisms” [Economic Theory 8(1996)377–381]," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 32(2), pages 411-416, August.
    16. Diebold, Franz & Bichler, Martin, 2017. "Matching with indifferences: A comparison of algorithms in the context of course allocation," European Journal of Operational Research, Elsevier, vol. 260(1), pages 268-282.
    17. Lars Ehlers & Bettina Klaus, 2012. "Strategy-Proofness Makes the Difference : Deferred-Acceptance with Responsive Priorities," Cahiers de recherche 15-2012, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    18. Bettina Klaus & Flip Klijn, 2006. "Procedurally fair and stable matching," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 27(2), pages 431-447, January.
    19. Yann Bramoullé & Brian W. Rogers & Erdem Yenerdag, 2022. "Matching with Recall," AMSE Working Papers 2203, Aix-Marseille School of Economics, France.
    20. Hatfield, John William & Kominers, Scott Duke, 2017. "Contract design and stability in many-to-many matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 78-97.

    More about this item

    Keywords

    Two-sided matching; incomplete information; stability; learning-blocking path; convergence;
    All these keywords.

    JEL classification:

    • 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

    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:the:publsh:3088. 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: Martin J. Osborne (email available below). General contact details of provider: http://econtheory.org .

    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.