IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v49y2024i2p1263-1277.html

Extension of Additive Valuations to General Valuations on the Existence of EFX

Author

Listed:
  • Ryoga Mahara

    (Research Institute for Mathematical Sciences, University of Tokyo, Tokyo 113-8656, Japan)

Abstract

Envy freeness is one of the most widely studied notions in fair division. Because envy-free allocations do not always exist when items are indivisible, several relaxations have been considered. Among them, possibly the most compelling notion is envy freeness up to any item (EFX). Informally speaking, EFX requires that no agent i envies another agent j after the removal of any item in j ’s bundle. The existence of EFX allocations is a major open problem. We study the existence of EFX allocations when agents have general valuations. For general valuations, it is known that an EFX allocation always exists (i) when n = 2 or (ii) when all agents have identical valuations, where n is the number of agents. It is also known that an EFX allocation always exists when one can leave at most n − 1 items unallocated. We develop new techniques and extend some results of additive valuations to general valuations on the existence of EFX allocations. We show that an EFX allocation always exists (i) when all agents have one of two general valuations or (ii) when the number of items is at most n + 3. We also show that an EFX allocation always exists when one can leave at most n − 2 items unallocated. In addition to the positive results, we construct an instance with n = 3, in which an existing approach does not work.

Suggested Citation

  • Ryoga Mahara, 2024. "Extension of Additive Valuations to General Valuations on the Existence of EFX," Mathematics of Operations Research, INFORMS, vol. 49(2), pages 1263-1277, May.
  • Handle: RePEc:inm:ormoor:v:49:y:2024:i:2:p:1263-1277
    DOI: 10.1287/moor.2022.0044
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.0044
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2022.0044?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
    ---><---

    References listed on IDEAS

    as
    1. Herve Moulin, 2004. "Fair Division and Collective Welfare," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262633116, December.
    2. Eric Budish, 2011. "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes," Journal of Political Economy, University of Chicago Press, vol. 119(6), pages 1061-1103.
    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. Tzeh Yuan Neoh & Nicholas Teh, 2025. "Understanding EFX Allocations: Counting and Variants," Papers 2504.03951, arXiv.org.
    2. Eugene Lim & Tzeh Yuan Neoh & Nicholas Teh, 2026. "The Cost of EFX: Generalized-Mean Welfare and Complexity Dichotomies with Few Surplus Items," Papers 2601.12849, arXiv.org.
    3. Wentao He & Biaoshuai Tao, 2026. "EFX for Additive Chores: Nonexistence, Pareto Incompatibility, and Bi-Valued Existence," Papers 2606.08872, arXiv.org, revised Jul 2026.

    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. Cole, Richard & Tao, Yixin, 2021. "On the existence of Pareto Efficient and envy-free allocations," Journal of Economic Theory, Elsevier, vol. 193(C).
    2. Hadi Hosseini, 2023. "The Fairness Fair: Bringing Human Perception into Collective Decision-Making," Papers 2312.14402, arXiv.org.
    3. Georgios Gerasimou, 2019. "Simple Preference Intensity Comparisons," Discussion Paper Series, School of Economics and Finance 201905, School of Economics and Finance, University of St Andrews, revised 27 Apr 2020.
    4. Fedor Sandomirskiy & Erel Segal-Halevi, 2022. "Efficient Fair Division with Minimal Sharing," Operations Research, INFORMS, vol. 70(3), pages 1762-1782, May.
    5. Goko, Hiromichi & Igarashi, Ayumi & Kawase, Yasushi & Makino, Kazuhisa & Sumita, Hanna & Tamura, Akihisa & Yokoi, Yu & Yokoo, Makoto, 2024. "A fair and truthful mechanism with limited subsidy," Games and Economic Behavior, Elsevier, vol. 144(C), pages 49-70.
    6. Moshe Babaioff & Tomer Ezra & Uriel Feige, 2024. "Fair-Share Allocations for Agents with Arbitrary Entitlements," Mathematics of Operations Research, INFORMS, vol. 49(4), pages 2180-2211, November.
    7. Jonathan Scarlett & Nicholas Teh & Yair Zick, 2023. "For One and All: Individual and Group Fairness in the Allocation of Indivisible Goods," Papers 2302.06958, arXiv.org.
    8. Erel Segal-Halevi & Shmuel Nitzan, 2014. "Cake Cutting – Fair and Square," Working Papers 2014-01, Bar-Ilan University, Department of Economics.
    9. Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
    10. Aygün, Orhan & Turhan, Bertan, 2021. "How to De-reserve Reserves," ISU General Staff Papers 202103100800001123, Iowa State University, Department of Economics.
    11. Parag A. Pathak & Alex Rees-Jones & Tayfun Sönmez, 2025. "Immigration Lottery Design: Engineered and Coincidental Consequences of H-1B Reforms," The Review of Economics and Statistics, MIT Press, vol. 107(1), pages 1-13, January.
    12. Shai Vardi & Alexandros Psomas & Eric Friedman, 2022. "Dynamic Fair Resource Division," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 945-968, May.
    13. Josué Ortega & Erel Segal-Halevi, 2022. "Obvious manipulations in cake-cutting," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(4), pages 969-988, November.
    14. Julien Combe & Vladyslav Nora & Olivier Tercieux, 2021. "Dynamic assignment without money: Optimality of spot mechanisms," Working Papers 2021-11, Center for Research in Economics and Statistics.
    15. Jens Gudmundsson & Jens Leth Hougaard & Erik Ansink, 2024. "Towards fully decentralized environmental regulation," Tinbergen Institute Discussion Papers 24-035/VIII, Tinbergen Institute.
    16. Luofeng Liao & Christian Kroer, 2024. "Statistical Inference and A/B Testing in Fisher Markets and Paced Auctions," Papers 2406.15522, arXiv.org, revised Mar 2025.
    17. Sridhar Mandyam & Usha Sridhar, 2017. "DON and Shapley Value for Allocation among Cooperating Agents in a Network: Conditions for Equivalence," Studies in Microeconomics, , vol. 5(2), pages 143-161, December.
    18. Miralles, Antonio & Pycia, Marek, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," Journal of Economic Theory, Elsevier, vol. 196(C).
    19. Eric Budish & Gérard P. Cachon & Judd B. Kessler & Abraham Othman, 2017. "Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation," Operations Research, INFORMS, vol. 65(2), pages 314-336, April.
    20. Bhaskar Ray Chaudhury & Jugal Garg & Kurt Mehlhorn & Ruta Mehta & Pranabendu Misra, 2024. "Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number," Mathematics of Operations Research, INFORMS, vol. 49(4), pages 2323-2340, November.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    JEL classification:

    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:inm:ormoor:v:49:y:2024:i:2:p:1263-1277. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.