IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2206.05879.html
   My bibliography  Save this paper

Fair Division with Two-Sided Preferences

Author

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

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

  • Ayumi Igarashi & Yasushi Kawase & Warut Suksompong & Hanna Sumita, 2022. "Fair Division with Two-Sided Preferences," Papers 2206.05879, arXiv.org, revised Aug 2024.
    • Handle: RePEc:arx:papers:2206.05879
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2206.05879
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Wu, Qingyun & Roth, Alvin E., 2018. "The lattice of envy-free matchings," Games and Economic Behavior, Elsevier, vol. 109(C), pages 201-211.
    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)

    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. Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
    2. 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.
    3. Aygün, Orhan & Turhan, Bertan, 2021. "How to De-reserve Reserves," ISU General Staff Papers 202103100800001123, Iowa State University, Department of Economics.
    4. 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.
    5. 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.
    6. 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.
    7. Luofeng Liao & Christian Kroer, 2024. "Statistical Inference and A/B Testing in Fisher Markets and Paced Auctions," Papers 2406.15522, arXiv.org, revised Aug 2024.
    8. Miralles, Antonio & Pycia, Marek, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," Journal of Economic Theory, Elsevier, vol. 196(C).
    9. 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.
    10. Parag A. Pathak & Tayfun Sönmez & M. Utku Ünver & M. Bumin Yenmez, 2024. "Fair Allocation of Vaccines, Ventilators and Antiviral Treatments: Leaving No Ethical Value Behind in Healthcare Rationing," Management Science, INFORMS, vol. 70(6), pages 3999-4036, June.
    11. Ágoston, Kolos Csaba & Biró, Péter & Kováts, Endre & Jankó, Zsuzsanna, 2022. "College admissions with ties and common quotas: Integer programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 722-734.
    12. 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.
    13. Dur, Umut Mert & Wiseman, Thomas, 2019. "School choice with neighbors," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 101-109.
    14. 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.
    15. Antonio Miralles & Marek Pycia, 2017. "Large vs. Continuum Assignment Economies: Efficiency and Envy-Freeness," Working Papers 950, Barcelona School of Economics.
    16. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    17. Condorelli, Daniele, 2013. "Market and non-market mechanisms for the optimal allocation of scarce resources," Games and Economic Behavior, Elsevier, vol. 82(C), pages 582-591.
    18. Bogomolnaia, Anna & Holzman, Ron & Moulin, Hervé, 2023. "On guarantees, vetoes and random dictators," Theoretical Economics, Econometric Society, vol. 18(1), January.
    19. Takehiro Ito & Yuni Iwamasa & Naonori Kakimura & Naoyuki Kamiyama & Yusuke Kobayashi & Yuta Nozaki & Yoshio Okamoto & Kenta Ozeki, 2022. "Reforming an Envy-Free Matching," Papers 2207.02641, arXiv.org.
    20. Mithun Chakraborty & Erel Segal-Halevi & Warut Suksompong, 2021. "Weighted Fairness Notions for Indivisible Items Revisited," Papers 2112.04166, arXiv.org, revised Jun 2024.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:2206.05879. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.