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

Object reallocation problems with single-dipped preferences

Author

Listed:
  • Tamura, Yuki

Abstract

For object reallocation problems, TTC is the leading rule: if preferences are strict but otherwise unrestricted, it is the only rule satisfying efficiency, the endowments lower bounds, and strategy-proofness (Ma, 1994); moreover, it is the only rule satisfying the endowments lower bounds, strategy-proofness, and endowment-swapping-proofness (Fujinaka and Wakayama, 2018). We focus on the domain of single-dipped preferences, and ask whether these results hold there. We show that they do. Returning to preferences that are strict but otherwise unrestricted, TTC is not “obviously strategy-proof” (Li, 2017). Again we ask if this remains true on the domain of single-dipped preferences, and show that on this domain, TTC does satisfy this property. Moreover, the domain of single-dipped preferences is a maximal domain on which TTC is obviously strategy-proof.

Suggested Citation

  • Tamura, Yuki, 2023. "Object reallocation problems with single-dipped preferences," Games and Economic Behavior, Elsevier, vol. 140(C), pages 181-196.
    • Handle: RePEc:eee:gamebe:v:140:y:2023:i:c:p:181-196
    DOI: 10.1016/j.geb.2023.03.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825623000386
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2023.03.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. Salvador Barberà & Dolors Berga & Bernardo Moreno, 2012. "Domains, ranges and strategy-proofness: the case of single-dipped preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(2), pages 335-352, July.
    2. Ashlagi, Itai & Gonczarowski, Yannai A., 2018. "Stable matching mechanisms are not obviously strategy-proof," Journal of Economic Theory, Elsevier, vol. 177(C), pages 405-425.
    3. Bade, Sophie, 2019. "Matching with single-peaked preferences," Journal of Economic Theory, Elsevier, vol. 180(C), pages 81-99.
    4. Anno, Hidekazu, 2015. "A short proof for the characterization of the core in housing markets," Economics Letters, Elsevier, vol. 126(C), pages 66-67.
    5. 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.
    6. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.
    7. Vikram Manjunath, 2014. "Efficient and strategy-proof social choice when preferences are single-dipped," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(3), pages 579-597, August.
    8. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    9. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    10. 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. Dietzenbacher, Bas & Tamura, Yuki, 2023. "Fair and efficient allocations when preferences are single-dipped," Research Memorandum 009, Maastricht University, Graduate School of Business and Economics (GSBE).
    2. Dietzenbacher, Bas & Tamura, Yuki, 2023. "Stable and efficient reallocations when preferences are single-dipped," Economics Letters, Elsevier, vol. 231(C).
    3. Doudou Gong & Bas Dietzenbacher & Hans Peters, 2024. "Mechanisms and axiomatics for division problems with single-dipped preferences," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 78(3), pages 789-813, November.
    4. Hu, Xinquan & Zhang, Jun, 2024. "Characterization of Top Trading Cycles with single-dipped preferences," Economics Letters, Elsevier, vol. 241(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. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    2. Yuki Tamura, 2022. "Object reallocation problems under single-peaked preferences: two characterizations of the crawler," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(3), pages 537-565, November.
    3. Yajing Chen & Zhenhua Jiao & Chenfeng Zhang & Luosai Zhang, 2021. "The Machiavellian frontier of top trading cycles," Papers 2106.14456, arXiv.org, revised Apr 2024.
    4. 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).
    5. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    6. Chen, Yajing & Zhao, Fang, 2021. "Alternative characterizations of the top trading cycles rule in housing markets," Economics Letters, Elsevier, vol. 201(C).
    7. Yannai A. Gonczarowski & Clayton Thomas, 2022. "Structural Complexities of Matching Mechanisms," Papers 2212.08709, arXiv.org, revised Mar 2024.
    8. Shengwu Li, 2024. "Designing Simple Mechanisms," Papers 2403.18694, arXiv.org, revised Jul 2024.
    9. Mandal, Pinaki & Roy, Souvik, 2022. "On obviously strategy-proof implementation of fixed priority top trading cycles with outside options," Economics Letters, Elsevier, vol. 211(C).
    10. Clayton Thomas, 2020. "Classification of Priorities Such That Deferred Acceptance is Obviously Strategyproof," Papers 2011.12367, arXiv.org, revised Feb 2021.
    11. Di Feng, 2023. "Efficiency in Multiple-Type Housing Markets," Papers 2308.14989, arXiv.org, revised Dec 2023.
    12. Fujinaka, Yuji & Wakayama, Takuma, 2018. "Endowments-swapping-proof house allocation," Games and Economic Behavior, Elsevier, vol. 111(C), pages 187-202.
    13. Louis Golowich & Shengwu Li, 2021. "On the Computational Properties of Obviously Strategy-Proof Mechanisms," Papers 2101.05149, arXiv.org, revised Oct 2022.
    14. 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.
    15. 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.
    16. Takamiya, Koji, 2001. "Coalition strategy-proofness and monotonicity in Shapley-Scarf housing markets," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 201-213, March.
    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. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2023. "All sequential allotment rules are obviously strategy-proof," Theoretical Economics, Econometric Society, vol. 18(3), July.
    20. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.

    More about this item

    Keywords

    Object reallocation problems; Single-dipped preferences; TTC; Obvious strategy-proofness;
    All these keywords.

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D47 - Microeconomics - - Market Structure, Pricing, and Design - - - Market Design

    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:140:y:2023:i:c:p:181-196. 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.