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
    ---><---

    References listed on IDEAS

    as
    1. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    2. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    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. Dilek Sayedahmed, 2022. "Centralized refugee matching mechanisms with hierarchical priority classes," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 7(1), pages 71-111, December.
    2. Kondratev, Aleksei Y. & Nesterov, Alexander S., 2022. "Minimal envy and popular matchings," European Journal of Operational Research, Elsevier, vol. 296(3), pages 776-787.
    3. Can, Burak & Pourpouneh, Mohsen & Storcken, Ton, 2017. "Cost of transformation: a measure on matchings," Research Memorandum 015, Maastricht University, Graduate School of Business and Economics (GSBE).
    4. Bettina Klaus & Claudia Meo, 2023. "The core for housing markets with limited externalities," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(3), pages 779-811, October.
    5. Tommy Andersson & Lars Ehlers & Lars-Gunnar Svensson & Ryan Tierney, 2022. "Gale’s Fixed Tax for Exchanging Houses," Mathematics of Operations Research, INFORMS, vol. 47(4), pages 3110-3128, November.
    6. Ata Atay & Ana Mauleon & Vincent Vannetelbosch, 2025. "Limited Farsightedness in Priority‐Based Matching," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 27(4), August.
    7. Mamoru Kaneko, 1980. "A Necessary and Sufficient Condition for the Nonemptiness of the Cores of Partitioning Games," Cowles Foundation Discussion Papers 566, Cowles Foundation for Research in Economics, Yale University.
    8. Buechel, Berno & Krähenmann, Philemon, 2022. "Fixed price equilibria on peer‐to‐peer platforms: Lessons from time‐based currencies," Journal of Economic Behavior & Organization, Elsevier, vol. 195(C), pages 335-358.
    9. Pablo Guillen & Róbert F. Veszteg, 2021. "Strategy-proofness in experimental matching markets," Experimental Economics, Springer;Economic Science Association, vol. 24(2), pages 650-668, June.
    10. Marco LiCalzi, 2022. "Bipartite choices," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 45(2), pages 551-568, December.
    11. Korpela, Ville & Lombardi, Michele & Saulle, Riccardo D., "undated". "An Implementation Approach to Rotation Programs," FEEM Working Papers 311054, Fondazione Eni Enrico Mattei (FEEM).
    12. James Schummer, 1999. "Almost-dominant Strategy Implementation," Discussion Papers 1278, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    13. Sreedurga Gogulapati & Yadati Narahari & Souvik Roy & Soumyarup Sadhukhan, 2025. "On Probabilistic Assignment Rules," Papers 2507.09550, arXiv.org.
    14. Battal Doğan & M. Bumin Yenmez, 2023. "When does an additional stage improve welfare in centralized assignment?," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(4), pages 1145-1173, November.
    15. Zhiwei Cui & Yan-An Hwang, 2017. "House exchange and residential segregation in networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(1), pages 125-147, March.
    16. 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.
    17. Troyan, Peter, 2024. "(Non-)obvious manipulability of rank-minimizing mechanisms," Journal of Mathematical Economics, Elsevier, vol. 113(C).
    18. Yajing Chen & Zhenhua Jiao & Chenfeng Zhang & Luosai Zhang, 2021. "The Machiavellian frontier of top trading cycles," Papers 2106.14456, arXiv.org, revised Apr 2024.
    19. Takamiya, Koji, 2001. "Coalition strategy-proofness and monotonicity in Shapley-Scarf housing markets," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 201-213, March.
    20. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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: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.

    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: 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.