IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v51y2014icp163-177.html
   My bibliography  Save this article

A general equivalence theorem for allocation of indivisible objects

Author

Listed:
  • Carroll, Gabriel

Abstract

We consider situations in which n indivisible objects are to be allocated to n agents. A number of recent papers studying such allocation problems have shown various interesting equivalences between randomized mechanisms based on trading and randomized mechanisms based on serial dictatorship. We prove a very general equivalence theorem from which many previous equivalence results immediately follow, and we give several new applications. Our general result sheds some light on why these equivalences hold by presenting the existing serial-dictatorship-based mechanisms as randomizations of a general mechanism which we call serial dictatorship in groups. Our proof technique also streamlines the bijective methods used in previous proofs, showing that it is enough to assemble a bijection from smaller pieces, without needing to construct the pieces explicitly.

Suggested Citation

  • Carroll, Gabriel, 2014. "A general equivalence theorem for allocation of indivisible objects," Journal of Mathematical Economics, Elsevier, vol. 51(C), pages 163-177.
    • Handle: RePEc:eee:mateco:v:51:y:2014:i:c:p:163-177
    DOI: 10.1016/j.jmateco.2013.12.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406813001237
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jmateco.2013.12.006?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. Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
    2. Lars-Gunnar Svensson & Bo Larsson, 2005. "Strategy-proofness, core, and sequential trade," Review of Economic Design, Springer;Society for Economic Design, vol. 9(2), pages 167-190, April.
    3. Kojima, Fuhito, 2009. "Random assignment of multiple indivisible objects," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 134-142, January.
    4. Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Kidney Exchange," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 119(2), pages 457-488.
    5. Thayer Morrill, 2013. "An alternative characterization of top trading cycles," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 54(1), pages 181-197, September.
    6. Sonmez, Tayfun & Utku Unver, M., 2005. "House allocation with existing tenants: an equivalence," Games and Economic Behavior, Elsevier, vol. 52(1), pages 153-185, July.
    7. , A. & ,, 2011. "Lotteries in student assignment: An equivalence result," Theoretical Economics, Econometric Society, vol. 6(1), January.
    8. Abdulkadiroglu, Atila & Sonmez, Tayfun, 1999. "House Allocation with Existing Tenants," Journal of Economic Theory, Elsevier, vol. 88(2), pages 233-260, October.
    9. John Hatfield, 2009. "Strategy-proof, efficient, and nonbossy quota allocations," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 33(3), pages 505-515, September.
    10. Lars Ehlers & Bettina Klaus, 2004. "Resource-monotonicity for house allocation problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 32(4), pages 545-560, August.
    11. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    12. Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
    13. Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
    14. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    15. Roth, Alvin E., 1982. "Incentive compatibility in a market with indivisible goods," Economics Letters, Elsevier, vol. 9(2), pages 127-132.
    16. Roth, Alvin E. & Postlewaite, Andrew, 1977. "Weak versus strong domination in a market with indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 4(2), pages 131-137, August.
    17. Szilvia Pápai, 2001. "Strategyproof and Nonbossy Multiple Assignments," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 3(3), pages 257-271, July.
    18. 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.
    19. Ma, Jinpeng, 1994. "Strategy-Proofness and the Strict Core in a Market with Indivisibilities," International Journal of Game Theory, Springer;Game Theory Society, vol. 23(1), pages 75-83.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Patrick Harless & William Phan, 2020. "On endowments and indivisibility: partial ownership in the Shapley–Scarf model," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(2), pages 411-435, September.
    2. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
    3. Sophie Bade, 2020. "Random Serial Dictatorship: The One and Only," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 353-368, February.
    4. Yuki Tamura & Hadi Hosseini, 2019. "The Crawler: Three Equivalence Results for Object (Re)allocation Problems when Preferences Are Single-peaked," Papers 1912.06909, arXiv.org, revised Feb 2022.
    5. Nick Arnosti, 2023. "Lottery Design for School Choice," Management Science, INFORMS, vol. 69(1), pages 244-259, January.
    6. Che, Yeon-Koo & Tercieux, Olivier, 2018. "Payoff equivalence of efficient mechanisms in large matching markets," Theoretical Economics, Econometric Society, vol. 13(1), January.
    7. Marek Pycia & Peter Troyan, 2021. "A theory of simplicity in games and mechanism design," ECON - Working Papers 393, Department of Economics - University of Zurich.
    8. Marek Pycia & M. Utku Ünver, 2022. "Outside options in neutral allocation of discrete resources," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 581-604, December.
    9. Ashlagi, Itai & Nikzad, Afshin, 2020. "What matters in school choice tie-breaking? How competition guides design," Journal of Economic Theory, Elsevier, vol. 190(C).
    10. Altuntaş, Açelya & Phan, William, 2022. "Trading probabilities along cycles," Journal of Mathematical Economics, Elsevier, vol. 100(C).
    11. Ekici, Özgün, 2020. "Random mechanisms for house allocation with existing tenants," Journal of Mathematical Economics, Elsevier, vol. 89(C), pages 53-65.
    12. Ashlagi, Itai & Nikzad, Afshin & Romm, Assaf, 2019. "Assigning more students to their top choices: A comparison of tie-breaking rules," Games and Economic Behavior, Elsevier, vol. 115(C), pages 167-187.
    13. Nesterov, Alexander S., 2017. "Fairness and efficiency in strategy-proof object allocation mechanisms," Journal of Economic Theory, Elsevier, vol. 170(C), pages 145-168.
    14. Sophie Bade, 2016. "Pareto-optimal matching allocation mechanisms for boundedly rational agents," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 501-510, October.
    15. Xinghua Long & Rodrigo A. Velez, 2021. "Balanced House Allocation," Papers 2109.01992, arXiv.org.
    16. Tamura, Yuki & Hosseini, Hadi, 2022. "The crawler: Three equivalence results for object (re)allocation problems when preferences are single-peaked," Journal of Economic Theory, Elsevier, vol. 203(C).

    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. YIlmaz, Özgür, 2010. "The probabilistic serial mechanism with private endowments," Games and Economic Behavior, Elsevier, vol. 69(2), pages 475-491, July.
    2. Ekici, Özgün, 2013. "Reclaim-proof allocation of indivisible objects," Games and Economic Behavior, Elsevier, vol. 81(C), pages 1-10.
    3. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    4. Yuji Fujinaka & Takuma Wakayama, 2011. "Secure implementation in Shapley–Scarf housing markets," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 48(1), pages 147-169, September.
    5. Ekici, Özgün, 2020. "Random mechanisms for house allocation with existing tenants," Journal of Mathematical Economics, Elsevier, vol. 89(C), pages 53-65.
    6. Ehlers, Lars, 2014. "Top trading with fixed tie-breaking in markets with indivisible goods," Journal of Economic Theory, Elsevier, vol. 151(C), pages 64-87.
    7. Anno, Hidekazu & Kurino, Morimitsu, 2016. "On the operation of multiple matching markets," Games and Economic Behavior, Elsevier, vol. 100(C), pages 166-185.
    8. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
    9. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    10. Fujinaka, Yuji & Wakayama, Takuma, 2018. "Endowments-swapping-proof house allocation," Games and Economic Behavior, Elsevier, vol. 111(C), pages 187-202.
    11. Thomson, William, 2011. "Chapter Twenty-One - Fair Allocation Rules," Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 2, chapter 21, pages 393-506, Elsevier.
    12. Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Kidney Exchange," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 119(2), pages 457-488.
    13. Anno, Hidekazu, 2015. "A short proof for the characterization of the core in housing markets," Economics Letters, Elsevier, vol. 126(C), pages 66-67.
    14. Tayfun Sönmez & M. Utku Ünver, 2006. "Kidney Exchange with Good Samaritan Donors: A Characterization," Boston College Working Papers in Economics 640, Boston College Department of Economics.
    15. Jingsheng Yu & Jun Zhang, 2020. "Efficient and fair trading algorithms in market design environments," Papers 2005.06878, arXiv.org, revised May 2021.
    16. Marek Pycia & M. Utku Ünver, 2022. "Outside options in neutral allocation of discrete resources," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 581-604, December.
    17. Sonmez, Tayfun & Utku Unver, M., 2005. "House allocation with existing tenants: an equivalence," Games and Economic Behavior, Elsevier, vol. 52(1), pages 153-185, July.
    18. Bettina Klaus & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'économie 14.07, Université de Lausanne, Faculté des HEC, Département d’économie.
    19. Sönmez, Tayfun & Ünver, M. Utku, 2010. "House allocation with existing tenants: A characterization," Games and Economic Behavior, Elsevier, vol. 69(2), pages 425-445, July.
    20. 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.

    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:mateco:v:51:y:2014:i:c:p:163-177. 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/jmateco .

    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.