IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v131y2024icp5-16.html
   My bibliography  Save this article

Designing information to improve welfare in matching markets

Author

Listed:
  • Dasgupta, Sulagna

Abstract

In matching markets, objects are allocated to agents without monetary transfers, based on agents’ preferences. However, agents may not have enough information to determine their preferences over the objects precisely. How should a benevolent planner optimally reveal information to maximize social welfare in this context? I show that when agents are symmetric and there are just two options, letting each agent know his rank in the realized distribution of preferences – but not his actual preferences – always improves social welfare over providing no information. When there are more objects, this rank-based information policy generalizes to the Object Recommendation (OR) Signal, which consists of simply recommending each agent to pick his socially-optimal choice. Under a mild regularity condition, I show that, when agents’ a priori relative preferences over the objects are “not too strong”, the OR Signal, used together with any standard ordinal mechanism, not only maximizes welfare, but achieves the unconstrained social optimum — formalizing the intuition that when people do not have strong opinions over several options, it is easy to sway them.

Suggested Citation

  • Dasgupta, Sulagna, 2024. "Designing information to improve welfare in matching markets," Mathematical Social Sciences, Elsevier, vol. 131(C), pages 5-16.
    • Handle: RePEc:eee:matsoc:v:131:y:2024:i:c:p:5-16
    DOI: 10.1016/j.mathsocsci.2024.06.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489624000520
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2024.06.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Emir Kamenica & Matthew Gentzkow, 2011. "Bayesian Persuasion," American Economic Review, American Economic Association, vol. 101(6), pages 2590-2615, October.
    2. Dirk Bergemann & Benjamin Brooks & Stephen Morris, 2017. "First‐Price Auctions With General Information Structures: Implications for Bidding and Revenue," Econometrica, Econometric Society, vol. 85, pages 107-143, January.
    3. Sean P. Corcoran & Jennifer L. Jennings & Sarah R. Cohodes & Carolyn Sattin-Bajaj, 2018. "Leveling the Playing Field for High School Choice: Results from a Field Experiment of Informational Interventions," NBER Working Papers 24471, National Bureau of Economic Research, Inc.
    4. Grenet, Julien & He, Yinghua & Kübler, Dorothea, 2019. "Decentralizing Centralized Matching Markets: Implications From Early Offers in University Admissions," Rationality and Competition Discussion Paper Series 158, CRC TRR 190 Rationality and Competition.
    5. 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.
    6. Bergemann, Dirk & Morris, Stephen, 2016. "Bayes correlated equilibrium and the comparison of information structures in games," Theoretical Economics, Econometric Society, vol. 11(2), May.
    7. ,, 2015. "Serial dictatorship: the unique optimal allocation rule when information is endogenous," Theoretical Economics, Econometric Society, vol. 10(2), May.
    8. Hylland, Aanund & Zeckhauser, Richard, 1979. "The Efficient Allocation of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 87(2), pages 293-314, April.
    9. Chakraborty, Archishman & Citanna, Alessandro & Ostrovsky, Michael, 2010. "Two-sided matching with interdependent values," Journal of Economic Theory, Elsevier, vol. 145(1), pages 85-105, January.
    10. Yinghua He & Antonio Miralles & Marek Pycia & Jianye Yan, 2018. "A Pseudo-Market Approach to Allocation with Priorities," American Economic Journal: Microeconomics, American Economic Association, vol. 10(3), pages 272-314, August.
    11. Jun Zhang & Junjie Zhou, 2016. "Information Disclosure in Contests: A Bayesian Persuasion Approach," Economic Journal, Royal Economic Society, vol. 126(597), pages 2197-2217, November.
    12. Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
    13. Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
    14. Jun Zhang & Junjie Zhou, 2016. "Information Disclosure in Contests: A Bayesian Persuasion Approach," Economic Journal, Royal Economic Society, vol. 126(597), pages 2197-2217.
    15. Atila Abdulkadiroglu & Tayfun Sönmez, 2003. "School Choice: A Mechanism Design Approach," American Economic Review, American Economic Association, vol. 93(3), pages 729-747, June.
    16. Qingmin Liu & George J. Mailath & Andrew Postlewaite & Larry Samuelson, 2014. "Stable Matching With Incomplete Information," Econometrica, Econometric Society, vol. 82(2), pages 541-587, March.
    17. Onur Kesten, 2010. "School Choice with Consent," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 125(3), pages 1297-1348.
    Full references (including those not matched with items on IDEAS)

    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. Miralles, Antonio & Pycia, Marek, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," Journal of Economic Theory, Elsevier, vol. 196(C).
    2. Feng, Xin, 2020. "Information disclosure on the contest mechanism," Journal of Mathematical Economics, Elsevier, vol. 91(C), pages 148-156.
    3. Jun Zhang & Federico Echenique & Antonio Miralles, 2018. "Fairness and Efficiency for Probabilistic Allocations with Endowments," Working Papers 1055, Barcelona School of Economics.
    4. 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.
    5. Anno, Hidekazu & Kurino, Morimitsu, 2016. "On the operation of multiple matching markets," Games and Economic Behavior, Elsevier, vol. 100(C), pages 166-185.
    6. Alcalde, Jose & Silva-Reus, José Ángel, 2013. "Allocating via Priorities," QM&ET Working Papers 13-3, University of Alicante, D. Quantitative Methods and Economic Theory.
    7. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
    8. Kesten, Onur & Unver, Utku, 2015. "A theory of school choice lotteries," Theoretical Economics, Econometric Society, vol. 10(2), May.
    9. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    10. Liu, Peng & Zeng, Huaxia, 2019. "Random assignments on preference domains with a tier structure," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 176-194.
    11. Pycia, Marek & Ünver, M. Utku, 2015. "Decomposing random mechanisms," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 21-33.
    12. YIlmaz, Özgür, 2010. "The probabilistic serial mechanism with private endowments," Games and Economic Behavior, Elsevier, vol. 69(2), pages 475-491, July.
    13. Nikhil Agarwal & Eric Budish, 2021. "Market Design," NBER Working Papers 29367, National Bureau of Economic Research, Inc.
    14. Noda, Shunya, 2022. "Strategic experimentation with random serial dictatorship," Games and Economic Behavior, Elsevier, vol. 133(C), pages 115-125.
    15. Onur Kesten & Morimitsu Kurino & Alexander S. Nesterov, 2017. "Efficient lottery design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 31-57, January.
    16. Rustamdjan Hakimov & Dorothea Kübler & Siqi Pan, 2023. "Costly information acquisition in centralized matching markets," Quantitative Economics, Econometric Society, vol. 14(4), pages 1447-1490, November.
    17. Ortega, Josué & Klein, Thilo, 2023. "The cost of strategy-proofness in school choice," Games and Economic Behavior, Elsevier, vol. 141(C), pages 515-528.
    18. Hashimoto, Tadashi, 2018. "The generalized random priority mechanism with budgets," Journal of Economic Theory, Elsevier, vol. 177(C), pages 708-733.
    19. Jingsheng Yu & Jun Zhang, 2020. "Efficient and fair trading algorithms in market design environments," Papers 2005.06878, arXiv.org, revised May 2021.
    20. Fuhito Kojima & M. Ünver, 2014. "The “Boston” school-choice mechanism: an axiomatic approach," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 55(3), pages 515-544, April.

    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:eee:matsoc:v:131:y:2024:i:c:p:5-16. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.