IDEAS home Printed from https://ideas.repec.org/p/pad/wpaper/0323.html

Complexity of the Object Allocation Problem with Minimum Number of Changes

Author

Listed:
  • Umutcan Salman

    (University of Padova)

Abstract

This paper studies the problem of reallocating objects to agents while taking into account agents’ endowments, object capacities and agents’ preferences. The goal is to find a Pareto efficient and individually rational allocation that minimizes the number of individuals who need to change from their initial allocation to the final one. We call this problem as MINDIST. We establish NP-completeness result for MINDIST. We also show that MINDIST remains NP-complete when we restrict individual preferences to be binary, meaning that each individual can rank at most two objects in the preferences. Finally, we present an integer programming formulation to solve small to moderately sized instances of the NP-hard problems.

Suggested Citation

  • Umutcan Salman, "undated". "Complexity of the Object Allocation Problem with Minimum Number of Changes," "Marco Fanno" Working Papers 0323, Dipartimento di Scienze Economiche "Marco Fanno".
    • Handle: RePEc:pad:wpaper:0323
    as

    Download full text from publisher

    File URL: https://economia.unipd.it/sites/economia.unipd.it/files/20250323.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:pad:wpaper:0323. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Raffaele Dei Campielisi (email available below). General contact details of provider: https://edirc.repec.org/data/dspadit.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.