Strategic Analysis of Fair Rank-Minimizing Mechanisms with Agent Refusal Option
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Kojima, Fuhito & Manea, Mihai, 2010. "Incentives in the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 145(1), pages 106-123, January.
- 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.
- Doğan, Battal & Yenmez, M. Bumin, 2019.
"Unified versus divided enrollment in school choice: Improving student welfare in Chicago,"
Games and Economic Behavior, Elsevier, vol. 118(C), pages 366-373.
- Battal Doğan & M. Bumin Yenmez, 2018. "Unified Versus Divided Enrollment in School Choice: Improving Student Welfare in Chicago," Bristol Economics Discussion Papers 18/705, School of Economics, University of Bristol, UK.
- Ortega, Josué & Klein, Thilo, 2023.
"The cost of strategy-proofness in school choice,"
Games and Economic Behavior, Elsevier, vol. 141(C), pages 515-528.
- Josue Ortega & Thilo Klein, 2022. "The cost of strategy-proofness in school choice," Papers 2204.07255, arXiv.org, revised Jul 2023.
- Troyan, Peter, 2024. "(Non-)obvious manipulability of rank-minimizing mechanisms," Journal of Mathematical Economics, Elsevier, vol. 113(C).
- Nikzad, Afshin, 2022. "Rank-optimal assignments in uniform markets," Theoretical Economics, Econometric Society, vol. 17(1), January.
- Eric Budish & Yeon-Koo Che & Fuhito Kojima & Paul Milgrom, 2013. "Designing Random Allocation Mechanisms: Theory and Applications," American Economic Review, American Economic Association, vol. 103(2), pages 585-623, April.
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.- Ivan Balbuzanov, 2016. "Convex strategyproofness with an application to the probabilistic serial mechanism," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 46(3), pages 511-520, March.
- Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
- Andrew McLennan & Shino Takayama & Yuki Tamura, 2024. "An Efficient, Computationally Tractable School Choice Mechanism," Discussion Papers Series 668, School of Economics, University of Queensland, Australia.
- 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.
- Kesten, Onur & Kurino, Morimitsu & Nesterov, Alexander, 2015. "Efficient lottery design," Discussion Papers, Research Unit: Market Behavior SP II 2015-203, WZB Berlin Social Science Center.
- Marek Bojko, 2020. "The Probabilistic Serial and Random Priority Mechanisms with Minimum Quotas," Papers 2012.11028, arXiv.org.
- Mennle, Timo & Seuken, Sven, 2021. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem," Journal of Economic Theory, Elsevier, vol. 191(C).
- Nguyen, Thành & Peivandi, Ahmad & Vohra, Rakesh, 2016. "Assignment problems with complementarities," Journal of Economic Theory, Elsevier, vol. 165(C), pages 209-241.
- Jingsheng Yu & Jun Zhang, 2020. "Efficient and fair trading algorithms in market design environments," Papers 2005.06878, arXiv.org, revised May 2021.
- 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.
- He, Yinghua & Miralles, Antonio & Pycia, Marek & Yan, Jianye, 2015. "A Pseudo-Market Approach to Allocation with Priorities," TSE Working Papers 15-601, Toulouse School of Economics (TSE), revised Jul 2017.
- Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
- Afacan, Mustafa Oǧuz, 2018. "The object allocation problem with random priorities," Games and Economic Behavior, Elsevier, vol. 110(C), pages 71-89.
- Haris Aziz & Yoichi Kasajima, 2017. "Impossibilities for probabilistic assignment," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 255-275, August.
- Eduardo M Azevedo & Eric Budish, 2019.
"Strategy-proofness in the Large,"
The Review of Economic Studies, Review of Economic Studies Ltd, vol. 86(1), pages 81-116.
- Eduardo M. Azevedo & Eric Budish, 2017. "Strategy-proofness in the Large," NBER Working Papers 23771, National Bureau of Economic Research, Inc.
- Wonki Jo Cho, 2018. "Probabilistic assignment: an extension approach," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(1), pages 137-162, June.
- 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.
- Scott Kominers & Alexander Teytelboym & Vincent Crawford, 2017. "An Invitation to Market Design," Working Papers 2017-069, Human Capital and Economic Opportunity Working Group.
- Kominers, Scott Duke & Teytelboym, Alexander & Crawford, Vincent P, 2017. "An invitation to market design," University of California at San Diego, Economics Working Paper Series qt3xp2110t, Department of Economics, UC San Diego.
- Miralles, Antonio & Pycia, Marek, 2021.
"Foundations of pseudomarkets: Walrasian equilibria for discrete resources,"
Journal of Economic Theory, Elsevier, vol. 196(C).
- Pycia, Marek & Miralles, Antonio, 2020. "Foundations of Pseudomarkets: Walrasian Equilibria for Discrete Resources," CEPR Discussion Papers 15161, C.E.P.R. Discussion Papers.
- Antonio Miralles & Marek Pycia, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," ECON - Working Papers 385, Department of Economics - University of Zurich.
- Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.
- Korpela, Ville & Lombardi, Michele & Saulle, Riccardo D., 2024.
"Designing rotation programs: Limits and possibilities,"
Games and Economic Behavior, Elsevier, vol. 143(C), pages 77-102.
- Ville Korpela & Michele Lombardi & Riccardo Saulle, 2022. "Designing Rotation Programs: Limits and Possibilities," Working Papers 202221, University of Liverpool, Department of Economics.
- Yusuke Narita, 2018. "Toward an Ethical Experiment," Cowles Foundation Discussion Papers 2127, Cowles Foundation for Research in Economics, Yale University.
- Han, Xiang, 2024. "On the efficiency and fairness of deferred acceptance with single tie-breaking," Journal of Economic Theory, Elsevier, vol. 218(C).
More about this item
NEP fields
This paper has been announced in the following NEP Reports:- NEP-DES-2024-09-16 (Economic Design)
- NEP-MIC-2024-09-16 (Microeconomics)
Statistics
Access and download statisticsCorrections
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:arx:papers:2408.01673. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.