IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v127y2024icp86-98.html
   My bibliography  Save this article

Computational complexity of necessary envy-freeness

Author

Listed:
  • Aziz, Haris
  • Schlotter, Ildikó
  • Walsh, Toby

Abstract

We consider the fundamental problem of fairly allocating indivisible items when agents have strict ordinal preferences over individual items. We focus on the well-studied fairness criterion of necessary envy-freeness. For a constant number of agents, the computational complexity of the deciding whether there exists an allocation that satisfies necessary envy-freeness has been open for several years. We settle this question by showing that the problem is NP-complete even for three agents. Considering that the problem is polynomial-time solvable for the case of two agents, we provide a clear understanding of the complexity of the problem with respect to the number of agents.

Suggested Citation

  • Aziz, Haris & Schlotter, Ildikó & Walsh, Toby, 2024. "Computational complexity of necessary envy-freeness," Mathematical Social Sciences, Elsevier, vol. 127(C), pages 86-98.
    • Handle: RePEc:eee:matsoc:v:127:y:2024:i:c:p:86-98
    DOI: 10.1016/j.mathsocsci.2023.08.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489623000677
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2023.08.002?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. Haris Aziz, 2016. "A generalization of the AL method for fair allocation of indivisible objects," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 4(2), pages 307-324, October.
    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.

      More about this item

      Keywords

      Fair division; Envy-freeness;

      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:matsoc:v:127:y:2024:i:c:p:86-98. 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/505565 .

      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.