Existence and Optimality of Envy-Free random allocations
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Federico Echenique & Antonio Miralles & Jun Zhang, 2019. "Fairness and efficiency for probabilistic allocations with participation constraints," Papers 1908.04336, arXiv.org, revised May 2020.
- 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.
- 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.
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.- Kornbluth, Daniel & Kushnir, Alexey & Nguyen, Thanh & Vohra, Rakesh, 2026. "Comment on “Assignment problems with complementarities” [J. Econ. Theory 165 (2016) 209-241]," Journal of Economic Theory, Elsevier, vol. 231(C).
- 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, Centre for Economic Policy Research.
- 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.
- Yasunori Okumura, 2024. "Strategic Analysis of Fair Rank-Minimizing Mechanisms with Agent Refusal Option," Papers 2408.01673, arXiv.org, revised Sep 2025.
- Yusuke Narita, 2018. "Toward an Ethical Experiment," Cowles Foundation Discussion Papers 2127, Cowles Foundation for Research in Economics, Yale University.
- Eun Jeong Heo & Vikram Manjunath, 2017. "Implementation in stochastic dominance Nash equilibria," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 5-30, January.
- Ping Zhan, 2023. "A Simple Characterization of Assignment Mechanisms on Set Constraints," SN Operations Research Forum, Springer, vol. 4(2), pages 1-15, June.
- Eric Budish & Judd B. Kessler, 2022. "Can Market Participants Report Their Preferences Accurately (Enough)?," Management Science, INFORMS, vol. 68(2), pages 1107-1130, February.
- Yusuke Narita, 2018.
"Experiment-as-Market: Incorporating Welfare into Randomized Controlled Trials,"
Cowles Foundation Discussion Papers
2127r, Cowles Foundation for Research in Economics, Yale University, revised May 2019.
- Yusuke Narita, 2019. "Experiment-as-Market: Incorporating Welfare into Randomized Controlled Trials," Working Papers 2019-025, Human Capital and Economic Opportunity Working Group.
- Ortega, Josué, 2020.
"Multi-unit assignment under dichotomous preferences,"
Mathematical Social Sciences, Elsevier, vol. 103(C), pages 15-24.
- Josue Ortega, 2017. "Multi-unit Assignment under Dichotomous Preferences," Papers 1703.10897, arXiv.org, revised Jul 2018.
- Ortega, Josué, 2018. "Multi-unit assignment under dichotomous preferences," ZEW Discussion Papers 18-052, ZEW - Leibniz Centre for European Economic Research.
- 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.
- Th`anh Nguyen & Alexander Teytelboym & Shai Vardi, 2025. "Efficiency, Envy, and Incentives in Combinatorial Assignment," Papers 2509.13198, arXiv.org, revised Oct 2025.
- Paul Gölz & Dominik Peters & Ariel D. Procaccia, 2026. "In This Apportionment Lottery, the House Always Wins," Operations Research, INFORMS, vol. 74(1), pages 390-407, January.
- 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.
- Young-San Lin & Hai Nguyen & Thành Nguyen & Kemal Altinkemer, 2022. "Allocation with Weak Priorities and General Constraints," Operations Research, INFORMS, vol. 70(5), pages 2804-2819, September.
- Zhan Wang & Jinpeng Ma & Hongwei Zhang, 2023. "Stable and envy-free lottery allocations for affordable housing," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 8(1), pages 1-55, December.
- Kenzo Imamura & Yasushi Kawase, 2026. "Stable and Fair Random Allocations in a Two-Sided Discrete-Concave Market," Papers 2606.18574, arXiv.org.
- Cole, Richard & Tao, Yixin, 2021. "On the existence of Pareto Efficient and envy-free allocations," Journal of Economic Theory, Elsevier, vol. 193(C).
More about this item
NEP fields
This paper has been announced in the following NEP Reports:- NEP-DES-2026-06-22 (Economic Design)
- NEP-UPT-2026-06-22 (Utility Models and Prospect Theory)
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:2605.28263. 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: https://arxiv.org/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.
Printed from https://ideas.repec.org/p/arx/papers/2605.28263.html