IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v136y2022icp428-453.html
   My bibliography  Save this article

Serial Rules in a Multi-Unit Shapley-Scarf Market

Author

Listed:
  • Biró, Péter
  • Klijn, Flip
  • Pápai, Szilvia

Abstract

We study generalized Shapley-Scarf exchange markets where each agent is endowed with multiple units of an indivisible and agent-specific good and monetary compensations are not possible. An outcome is given by a circulation which consists of a balanced exchange of goods. We focus on circulation rules that only require as input ordinal preference rankings of individual goods, and agents are assumed to have responsive preferences over bundles of goods. We study the properties of serial dictatorship rules which allow agents to choose either a single good or an entire bundle sequentially, according to a fixed ordering of the agents. We also introduce and explore extensions of these serial dictatorship rules that ensure individual rationality. The paper analyzes the normative and incentive properties of these four families of serial dictatorships and also shows that the individually rational extensions can be implemented with efficient graph algorithms.

Suggested Citation

  • Biró, Péter & Klijn, Flip & Pápai, Szilvia, 2022. "Serial Rules in a Multi-Unit Shapley-Scarf Market," Games and Economic Behavior, Elsevier, vol. 136(C), pages 428-453.
    • Handle: RePEc:eee:gamebe:v:136:y:2022:i:c:p:428-453
    DOI: 10.1016/j.geb.2022.10.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825622001439
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2022.10.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 look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Lars Ehlers & Bettina Klaus, 2003. "Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 21(2), pages 265-280, October.
    2. John William Hatfield & Scott Duke Kominers & Alexandru Nichifor & Michael Ostrovsky & Alexander Westkamp, 2013. "Stability and Competitive Equilibrium in Trading Networks," Journal of Political Economy, University of Chicago Press, vol. 121(5), pages 966-1005.
    3. 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.
    4. Julien Combe & Olivier Tercieux & Camille Terrier, 2022. "The Design of Teacher Assignment: Theory and Evidence," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 89(6), pages 3154-3222.
    5. Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," American Economic Review, American Economic Association, vol. 102(5), pages 2237-2271, August.
    6. Andrew Postlewaite, 1979. "Manipulation via Endowments," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 46(2), pages 255-262.
    7. Paul Milgrom, 2000. "Putting Auction Theory to Work: The Simultaneous Ascending Auction," Journal of Political Economy, University of Chicago Press, vol. 108(2), pages 245-272, April.
    8. Tommy Andersson & Ágnes Cseh & Lars Ehlers & Albin Erlanson, 2021. "Organizing Time Exchanges: Lessons from Matching Markets," American Economic Journal: Microeconomics, American Economic Association, vol. 13(1), pages 338-373, February.
    9. Konishi, Hideo & Quint, Thomas & Wako, Jun, 2001. "On the Shapley-Scarf economy: the case of multiple types of indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 35(1), pages 1-15, February.
    10. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(4), pages 691-705, August.
    11. Tommy ANDERSSON & Ágnes CSEH & Lars EHLERS & Albin ERLANSON, 2018. "Organizing Time Banks : Lessons from Matching Markets," Cahiers de recherche 11-2018, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    12. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(1), pages 225-228, February.
    13. Péter Csóka & P. Jean-Jacques Herings, 2018. "Decentralized Clearing in Financial Networks," Management Science, INFORMS, vol. 64(10), pages 4681-4699, October.
    14. Manjunath, Vikram & Westkamp, Alexander, 2021. "Strategy-proof exchange under trichotomous preferences," Journal of Economic Theory, Elsevier, vol. 193(C).
    15. Papai, Szilvia, 2007. "Exchange in a general market with indivisible goods," Journal of Economic Theory, Elsevier, vol. 132(1), pages 208-235, January.
    16. Manea, Mihai, 2007. "Serial dictatorship and Pareto optimality," Games and Economic Behavior, Elsevier, vol. 61(2), pages 316-330, November.
    17. Lars-Gunnar Svensson, 1999. "Strategy-proof allocation of indivisible goods," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 16(4), pages 557-567.
    18. Klaus, Bettina, 2008. "The coordinate-wise core for multiple-type housing markets is second-best incentive compatible," Journal of Mathematical Economics, Elsevier, vol. 44(9-10), pages 919-924, September.
    19. Szilvia PÂpai, 2000. "original papers : Strategyproof multiple assignment using quotas," Review of Economic Design, Springer;Society for Economic Design, vol. 5(1), pages 91-105.
    20. Mark A. Satterthwaite & Hugo Sonnenschein, 1981. "Strategy-Proof Allocation Mechanisms at Differentiable Points," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 48(4), pages 587-597.
    21. Papai, Szilvia, 2003. "Strategyproof exchange of indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 39(8), pages 931-959, November.
    22. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    23. Umut Mert Dur & M. Utku Ünver, 2019. "Two-Sided Matching via Balanced Exchange," Journal of Political Economy, University of Chicago Press, vol. 127(3), pages 1156-1177.
    24. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    25. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(5), pages 879-883, October.
    26. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(6), pages 1195-1198, December.
    27. 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.
    28. 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.
    29. 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.
    30. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(2), pages 411-413, April.
    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. Han, Xiang, 2024. "A theory of fair random allocation under priorities," Theoretical Economics, Econometric Society, vol. 19(3), July.
    2. Mih'aly P'eter Hanics, 2022. "Graph theoretical models and algorithms of portfolio compression," Papers 2212.09473, arXiv.org.

    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. Monte, Daniel & Tumennasan, Norovsambuu, 2015. "Centralized allocation in multiple markets," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 74-85.
    2. Di Feng & Bettina Klaus, 2022. "Preference revelation games and strict cores of multiple‐type housing market problems," International Journal of Economic Theory, The International Society for Economic Theory, vol. 18(1), pages 61-76, March.
    3. Papai, Szilvia, 2007. "Exchange in a general market with indivisible goods," Journal of Economic Theory, Elsevier, vol. 132(1), pages 208-235, January.
    4. Jörgen Kratz, 2017. "Overlapping multiple object assignments," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(3), pages 723-753, March.
    5. Di Feng, 2023. "Endowments-swapping-proofness and Efficiency in Multiple-Type Housing Markets," Discussion Paper Series DP2023-14, Research Institute for Economics & Business Administration, Kobe University.
    6. Monte, Daniel & Tumennasan, Norovsambuu, 2013. "Matching with quorums," Economics Letters, Elsevier, vol. 120(1), pages 14-17.
    7. 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.
    8. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    9. Altuntaş, Açelya & Phan, William & Tamura, Yuki, 2023. "Some characterizations of Generalized Top Trading Cycles," Games and Economic Behavior, Elsevier, vol. 141(C), pages 156-181.
    10. Nguyen, Thành & Peivandi, Ahmad & Vohra, Rakesh, 2016. "Assignment problems with complementarities," Journal of Economic Theory, Elsevier, vol. 165(C), pages 209-241.
    11. Franz Diebold & Haris Aziz & Martin Bichler & Florian Matthes & Alexander Schneider, 2014. "Course Allocation via Stable Matching," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 6(2), pages 97-110, April.
    12. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    13. Nhan-Tam Nguyen & Dorothea Baumeister & Jörg Rothe, 2018. "Strategy-proofness of scoring allocation correspondences for indivisible goods," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 50(1), pages 101-122, January.
    14. Antonio Romero‐Medina & Matteo Triossi, 2020. "Strategy‐proof and group strategy‐proof stable mechanisms: An equivalence," International Journal of Economic Theory, The International Society for Economic Theory, vol. 16(3), pages 349-354, September.
    15. Hoda Atef Yekta & Robert Day, 2020. "Optimization-based Mechanisms for the Course Allocation Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 641-660, July.
    16. Honda, Edward, 2021. "A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences," Journal of Mathematical Economics, Elsevier, vol. 94(C).
    17. Bettina Klaus & Alexandru Nichifor, 2020. "Serial dictatorship mechanisms with reservation prices," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(3), pages 665-684, October.
    18. Pinaki Mandal, 2022. "Simple dominance of fixed priority top trading cycles," Papers 2204.02154, arXiv.org, revised Feb 2023.
    19. Shuhei Morimoto & Shigehiro Serizawa & Stephen Ching, 2013. "A characterization of the uniform rule with several commodities and agents," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(3), pages 871-911, March.
    20. Caspari, Gian, 2020. "Booster draft mechanism for multi-object assignment," ZEW Discussion Papers 20-074, ZEW - Leibniz Centre for European Economic Research.

    More about this item

    Keywords

    Indivisible goods; Circulation; Shapley-Scarf market; Serial dictatorship; Efficiency;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D61 - Microeconomics - - Welfare Economics - - - Allocative Efficiency; Cost-Benefit Analysis

    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:gamebe:v:136:y:2022:i:c:p:428-453. 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/622836 .

    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.