Impossibility results for weak strategy-proofness and respect for improvements in random assignment with priorities
Author
Abstract
Suggested Citation
DOI: 10.1016/j.econlet.2025.112700
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.References listed on IDEAS
- Han, Xiang, 2024. "A theory of fair random allocation under priorities," Theoretical Economics, Econometric Society, vol. 19(3), July.
- Hirata, Daisuke & 平田, 大祐 & Kasuya, Yusuke & 糟谷, 祐介 & Okumura, Yasunori & 奥村, 保規, 2023. "Stability, Strategy-Proofness, and Respect for Improvements," Discussion Papers 2023-01, Graduate School of Economics, Hitotsubashi University.
- Afacan, Mustafa Oǧuz, 2018. "The object allocation problem with random priorities," Games and Economic Behavior, Elsevier, vol. 110(C), pages 71-89.
- Schlegel, Jan Christoph, 2018. "A note on ex-ante stable lotteries," Economics Letters, Elsevier, vol. 164(C), pages 90-93.
- Han, Xiang, 2024. "On the efficiency and fairness of deferred acceptance with single tie-breaking," Journal of Economic Theory, Elsevier, vol. 218(C).
- 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.
- Hashimoto, Tadashi & Hirata, Daisuke & Kesten, Onur & Kurino, Morimitsu & Unver, Utku, 2014. "Two axiomatic approaches to the probabilistic serial mechanism," Theoretical Economics, Econometric Society, vol. 9(1), January.
- 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.
- 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.
- Zhang, Jun, 2019. "Efficient and fair assignment mechanisms are strongly group manipulable," Journal of Economic Theory, Elsevier, vol. 180(C), pages 167-177.
- Haris Aziz & Bettina Klaus, 2019.
"Random matching under priorities: stability and no envy concepts,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 53(2), pages 213-259, August.
- Haris Aziz & Bettina Klaus, 2017. "Random Matching under Priorities: Stability and No Envy Concepts," Cahiers de Recherches Economiques du Département d'économie 17.09bis, Université de Lausanne, Faculté des HEC, Département d’économie.
- Alvin E. Roth & Uriel G. Rothblum & John H. Vande Vate, 1993. "Stable Matchings, Optimal Assignments, and Linear Programming," Mathematics of Operations Research, INFORMS, vol. 18(4), pages 803-828, November.
- Kesten, Onur & Unver, Utku, 2015.
"A theory of school choice lotteries,"
Theoretical Economics, Econometric Society, vol. 10(2), May.
- Onur Kesten & M. Utku Ünver, 2010. "A Theory of School-Choice Lotteries," Boston College Working Papers in Economics 737, Boston College Department of Economics, revised 29 Jun 2012.
- Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
- Alvin E. Roth, 1982. "The Economics of Matching: Stability and Incentives," Mathematics of Operations Research, INFORMS, vol. 7(4), pages 617-628, November.
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.- Haris Aziz & Florian Brandl, 2020. "The Vigilant Eating Rule: A General Approach for Probabilistic Economic Design with Constraints," Papers 2008.08991, arXiv.org, revised Jul 2021.
- Aziz, Haris & Brandl, Florian, 2022. "The vigilant eating rule: A general approach for probabilistic economic design with constraints," Games and Economic Behavior, Elsevier, vol. 135(C), pages 168-187.
- Han, Xiang, 2024. "On the efficiency and fairness of deferred acceptance with single tie-breaking," Journal of Economic Theory, Elsevier, vol. 218(C).
- Schlegel, Jan Christoph & Mamageishvili, Akaki, 2020. "Welfare theorems for random assignments with priorities," Games and Economic Behavior, Elsevier, vol. 124(C), pages 62-81.
- Haris Aziz & Bettina Klaus, 2017. "Random Matching under Priorities: Stability and No Envy Concepts," Cahiers de Recherches Economiques du Département d'Econométrie et d'Economie politique (DEEP) 17.09, Université de Lausanne, Faculté des HEC, DEEP.
- Yang, Shanhui, 2024. "Characterizing a probabilistic version of the Boston mechanism under weak priorities," Economics Letters, Elsevier, vol. 244(C).
- Haris Aziz & Bettina Klaus, 2019.
"Random matching under priorities: stability and no envy concepts,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 53(2), pages 213-259, August.
- Haris Aziz & Bettina Klaus, 2017. "Random Matching under Priorities: Stability and No Envy Concepts," Cahiers de Recherches Economiques du Département d'économie 17.09bis, Université de Lausanne, Faculté des HEC, Département d’économie.
- José Alcalde & José Ángel Silva-Reus, 2013. "Allocating via Priorities," QM&ET Working Papers 13-3, University of Alicante, D. Quantitative Methods and Economic Theory.
- Afacan, Mustafa Oǧuz, 2018. "The object allocation problem with random priorities," Games and Economic Behavior, Elsevier, vol. 110(C), pages 71-89.
- Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
- Morrill, Thayer, 2015. "Making just school assignments," Games and Economic Behavior, Elsevier, vol. 92(C), pages 18-27.
- Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
- Yajing Chen & Patrick Harless & Zhenhua Jiao, 2024. "The fractional Boston random assignment rule and its axiomatic characterization," Review of Economic Design, Springer;Society for Economic Design, vol. 28(1), pages 21-43, February.
- 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.
- Schlegel, J. C., 2017. "A Note on Ex-Ante Stable Lotteries," Working Papers 17/06, Department of Economics, City St George's, University of London.
- Kesten, Onur & Kurino, Morimitsu, 2019. "Strategy-proof improvements upon deferred acceptance: A maximal domain for possibility," Games and Economic Behavior, Elsevier, vol. 117(C), pages 120-143.
- Thayer Morrill, 2015. "Two simple variations of top trading cycles," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(1), pages 123-140, September.
- Schlegel, Jan Christoph, 2018. "A note on ex-ante stable lotteries," Economics Letters, Elsevier, vol. 164(C), pages 90-93.
- Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth, 2009. "Strategy-proofness versus Efficiency in Matching with Indifferences: Redesigning the New York City High School Match," NBER Working Papers 14864, National Bureau of Economic Research, Inc.
- Kesten, Onur & Unver, Utku, 2015.
"A theory of school choice lotteries,"
Theoretical Economics, Econometric Society, vol. 10(2), May.
- Onur Kesten & M. Utku Ünver, 2010. "A Theory of School-Choice Lotteries," Boston College Working Papers in Economics 737, Boston College Department of Economics, revised 29 Jun 2012.
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:ecolet:v:257:y:2025:i:c:s0165176525005373. 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/ecolet .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.
Printed from https://ideas.repec.org/a/eee/ecolet/v257y2025ics0165176525005373.html