IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v147y2024icp268-287.html
   My bibliography  Save this article

Fair division with two-sided preferences

Author

Listed:
  • Igarashi, Ayumi
  • Kawase, Yasushi
  • Suksompong, Warut
  • Sumita, Hanna

Abstract

We study a fair division setting in which participants are to be fairly distributed among teams, where not only do the teams have preferences over the participants as in the canonical fair division setting, but the participants also have preferences over the teams. We focus on guaranteeing envy-freeness up to one participant (EF1) for the teams together with a stability condition for both sides. We show that an allocation satisfying EF1, swap stability, and individual stability always exists and can be computed in polynomial time, even when teams may have positive or negative values for participants. When teams have nonnegative values for participants, we prove that an EF1 and Pareto optimal allocation exists and, if the valuations are binary, can be found in polynomial time. We also show that an EF1 and justified envy-free allocation does not necessarily exist, and deciding whether such an allocation exists is computationally difficult.

Suggested Citation

  • Igarashi, Ayumi & Kawase, Yasushi & Suksompong, Warut & Sumita, Hanna, 2024. "Fair division with two-sided preferences," Games and Economic Behavior, Elsevier, vol. 147(C), pages 268-287.
    • Handle: RePEc:eee:gamebe:v:147:y:2024:i:c:p:268-287
    DOI: 10.1016/j.geb.2024.07.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825624001027
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2024.07.008?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. Anna Bogomolnaia & Hervé Moulin & Fedor Sandomirskiy & Elena Yanovskaya, 2017. "Competitive Division of a Mixed Manna," Econometrica, Econometric Society, vol. 85(6), pages 1847-1871, November.
    2. Wu, Qingyun & Roth, Alvin E., 2018. "The lattice of envy-free matchings," Games and Economic Behavior, Elsevier, vol. 109(C), pages 201-211.
    3. Atila Abdulkadiroğlu & Yeon-Koo Che & Parag A. Pathak & Alvin E. Roth & Olivier Tercieux, 2020. "Efficiency, Justified Envy, and Incentives in Priority-Based Matching," American Economic Review: Insights, American Economic Association, vol. 2(4), pages 425-442, December.
    4. Mithun Chakraborty & Ulrike Schmidt-Kraepelin & Warut Suksompong, 2021. "Picking Sequences and Monotonicity in Weighted Fair Division," Papers 2104.14347, arXiv.org, revised Aug 2021.
    5. 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.
    6. Moshe Babaioff & Noam Nisan & Inbal Talgam-Cohen, 2021. "Competitive Equilibrium with Indivisible Goods and Generic Budgets," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 382-403, February.
    7. 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.
    8. Hervé Moulin, 2019. "Fair Division in the Internet Age," Annual Review of Economics, Annual Reviews, vol. 11(1), pages 407-441, August.
    9. Mithun Chakraborty & Ayumi Igarashi & Warut Suksompong & Yair Zick, 2019. "Weighted Envy-Freeness in Indivisible Item Allocation," Papers 1909.10502, arXiv.org, revised Mar 2021.
    10. Soroush Ebadian & Dominik Peters & Nisarg Shah, 2022. "How to Fairly Allocate Easy and Difficult Chores," Post-Print hal-03834514, HAL.
    11. Siddharth Barman & Sanath Kumar Krishnamurthy & Rohit Vaish, 2018. "Greedy Algorithms for Maximizing Nash Social Welfare," Papers 1801.09046, arXiv.org.
    12. Vittorio Bil`o & Ioannis Caragiannis & Michele Flammini & Ayumi Igarashi & Gianpiero Monaco & Dominik Peters & Cosimo Vinci & William S. Zwicker, 2018. "Almost Envy-Free Allocations with Connected Bundles," Papers 1808.09406, arXiv.org, revised May 2022.
    13. Bilò, Vittorio & Caragiannis, Ioannis & Flammini, Michele & Igarashi, Ayumi & Monaco, Gianpiero & Peters, Dominik & Vinci, Cosimo & Zwicker, William S., 2022. "Almost envy-free allocations with connected bundles," Games and Economic Behavior, Elsevier, vol. 131(C), pages 197-221.
    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. Warut Suksompong & Nicholas Teh, 2022. "On Maximum Weighted Nash Welfare for Binary Valuations," Papers 2204.03803, arXiv.org, revised Apr 2022.
    3. Suksompong, Warut & Teh, Nicholas, 2023. "Weighted fair division with matroid-rank valuations: Monotonicity and strategyproofness," Mathematical Social Sciences, Elsevier, vol. 126(C), pages 48-59.
    4. Anna Bogomolnaia & Hervé Moulin, 2023. "Guarantees in Fair Division: General or Monotone Preferences," Mathematics of Operations Research, INFORMS, vol. 48(1), pages 160-176, February.
    5. Mithun Chakraborty & Erel Segal-Halevi & Warut Suksompong, 2021. "Weighted Fairness Notions for Indivisible Items Revisited," Papers 2112.04166, arXiv.org, revised Jun 2024.
    6. Warut Suksompong & Nicholas Teh, 2023. "Weighted Fair Division with Matroid-Rank Valuations: Monotonicity and Strategyproofness," Papers 2303.14454, arXiv.org, revised Sep 2023.
    7. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    8. Mackenzie, Andrew & Komornik, Vilmos, 2023. "Fairly taking turns," Games and Economic Behavior, Elsevier, vol. 142(C), pages 743-764.
    9. Anna Bogomolnaia & Herv'e Moulin, 2024. "Guaranteed shares of benefits and costs," Papers 2406.14198, arXiv.org, revised Nov 2024.
    10. Camacho, Franklin & Fonseca-Delgado, Rigoberto & Pino Pérez, Ramón & Tapia, Guido, 2023. "Generalized binary utility functions and fair allocations," Mathematical Social Sciences, Elsevier, vol. 121(C), pages 50-60.
    11. Caspari, Gian, 2020. "Booster draft mechanism for multi-object assignment," ZEW Discussion Papers 20-074, ZEW - Leibniz Centre for European Economic Research.
    12. Kondratev, Aleksei Y. & Nesterov, Alexander S., 2022. "Minimal envy and popular matchings," European Journal of Operational Research, Elsevier, vol. 296(3), pages 776-787.
    13. Simina Br^anzei & Fedor Sandomirskiy, 2019. "Algorithms for Competitive Division of Chores," Papers 1907.01766, arXiv.org, revised Jul 2023.
    14. Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
    15. 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.
    16. Aygün, Orhan & Turhan, Bertan, 2021. "How to De-reserve Reserves," ISU General Staff Papers 202103100800001123, Iowa State University, Department of Economics.
    17. Parag A. Pathak & Alex Rees-Jones & Tayfun Sönmez, 2020. "Immigration Lottery Design: Engineered and Coincidental Consequences of H-1B Reforms," NBER Working Papers 26767, National Bureau of Economic Research, Inc.
    18. Ehlers, Lars & Hafalir, Isa E. & Yenmez, M. Bumin & Yildirim, Muhammed A., 2014. "School choice with controlled choice constraints: Hard bounds versus soft bounds," Journal of Economic Theory, Elsevier, vol. 153(C), pages 648-683.
    19. Rodríguez-Álvarez, Carmelo & Romero-Medina, Antonio, 2024. "School choice with transferable student characteristics," Games and Economic Behavior, Elsevier, vol. 143(C), pages 103-124.
    20. Troyan, Peter, 2024. "(Non-)obvious manipulability of rank-minimizing mechanisms," Journal of Mathematical Economics, Elsevier, vol. 113(C).

    More about this item

    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:eee:gamebe:v:147:y:2024:i:c:p:268-287. 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/622836 .

    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.