IDEAS home Printed from https://ideas.repec.org/p/aoz/wpaper/49.html
   My bibliography  Save this paper

All sequential allotment rules are obviously strategy-proof

Author

Listed:
  • Pablo Arribillaga

    (Universidad de San Luis/CONICET)

  • Jordi Massó

    (Universitat Autonoma de Barcelona)

  • Alejandro Neme

    (Universidad de San Luis/CONICET)

Abstract

For division problems with single-peaked preferences (Sprumont, 1991) we show that all sequential allotment rules, identified by Barberà, Jackson and Neme (1997) as the class of strategy-proof, eficient and replacement monotonic rules, are also obviously strategy-proof. Although obvious strategy-proofness is in general more restrictive than strategy-proofness, this is not the case in this setting.

Suggested Citation

  • Pablo Arribillaga & Jordi Massó & Alejandro Neme, 2021. "All sequential allotment rules are obviously strategy-proof," Working Papers 49, Red Nacional de Investigadores en Economía (RedNIE).
    • Handle: RePEc:aoz:wpaper:49
    as

    Download full text from publisher

    File URL: https://drive.google.com/file/d/1fOktA96QjDqbODNiFrJOYktb_w48Ekyx/view
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Carmen Herrero & Ricardo Martínez, 2011. "Allocation problems with indivisibilities when preferences are single-peaked," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 2(4), pages 453-467, December.
    2. Moore, John & Repullo, Rafael, 1988. "Subgame Perfect Implementation," Econometrica, Econometric Society, vol. 56(5), pages 1191-1220, September.
    3. Moulin, Hervé, 2017. "One dimensional mechanism design," Theoretical Economics, Econometric Society, vol. 12(2), May.
    4. Carlos Alós-Ferrer & Klaus Ritzberger, 2013. "Large extensive form games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 52(1), pages 75-102, January.
    5. Haluk I. Ergin, 2002. "Efficient Resource Allocation on the Basis of Priorities," Econometrica, Econometric Society, vol. 70(6), pages 2489-2497, November.
    6. 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.
    7. Sprumont, Yves, 1991. "The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule," Econometrica, Econometric Society, vol. 59(2), pages 509-519, March.
    8. Thomson William, 1994. "Consistent Solutions to the Problem of Fair Division When Preferences Are Single-Peaked," Journal of Economic Theory, Elsevier, vol. 63(2), pages 219-245, August.
    9. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.
    10. Lawrence M. Ausubel, 2004. "An Efficient Ascending-Bid Auction for Multiple Objects," American Economic Review, American Economic Association, vol. 94(5), pages 1452-1475, December.
    11. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    12. Takuma Wakayama, 2017. "Bribe-proofness for single-peaked preferences: characterizations and maximality-of-domains results," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 357-385, August.
    13. Mackenzie, Andrew, 2018. "A revelation principle for obviously strategy-proof implementation," Research Memorandum 014, Maastricht University, Graduate School of Business and Economics (GSBE).
    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. Louis Golowich & Shengwu Li, 2021. "On the Computational Properties of Obviously Strategy-Proof Mechanisms," Papers 2101.05149, arXiv.org, revised Oct 2022.
    2. Pablo R. Arribillaga & Jordi Massó & Alejandro Neme, 2023. "Obvious Strategy-proofness with Respect to a Partition," Working Papers 293, Red Nacional de Investigadores en Economía (RedNIE).
    3. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2020. "On obvious strategy-proofness and single-peakedness," Journal of Economic Theory, Elsevier, vol. 186(C).
    4. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    5. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.

    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. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    2. Clayton Thomas, 2020. "Classification of Priorities Such That Deferred Acceptance is Obviously Strategyproof," Papers 2011.12367, arXiv.org, revised Feb 2021.
    3. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2020. "On obvious strategy-proofness and single-peakedness," Journal of Economic Theory, Elsevier, vol. 186(C).
    4. Breitmoser, Yves & Schweighofer-Kodritsch, Sebastian, 2019. "Obviousness around the clock," Discussion Papers, Research Unit: Market Behavior SP II 2019-203, WZB Berlin Social Science Center.
    5. Kazuhiko Hashimoto & Takuma Wakayama, 2021. "Fair reallocation in economies with single-peaked preferences," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(3), pages 773-785, September.
    6. Marek Pycia & Peter Troyan, 2021. "A theory of simplicity in games and mechanism design," ECON - Working Papers 393, Department of Economics - University of Zurich.
    7. Tamura, Yuki, 2023. "Object reallocation problems with single-dipped preferences," Games and Economic Behavior, Elsevier, vol. 140(C), pages 181-196.
    8. Michele Lombardi & Naoki Yoshihara, 2020. "Partially-honest Nash implementation: a full characterization," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(3), pages 871-904, October.
    9. Bó, Inácio & Hakimov, Rustamdjan, 2022. "The iterative deferred acceptance mechanism," Games and Economic Behavior, Elsevier, vol. 135(C), pages 411-433.
    10. 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).
    11. Kloosterman, Andrew & Troyan, Peter, 2020. "School choice with asymmetric information: priority design and the curse of acceptance," Theoretical Economics, Econometric Society, vol. 15(3), July.
    12. Jiangtao Li & Piotr Dworczak, 2020. "Are simple mechanisms optimal when agents are unsophisticated?," GRAPE Working Papers 42, GRAPE Group for Research in Applied Economics.
    13. Louis Golowich & Shengwu Li, 2021. "On the Computational Properties of Obviously Strategy-Proof Mechanisms," Papers 2101.05149, arXiv.org, revised Oct 2022.
    14. Mariya Halushka, 2021. "Obviously Strategy-proof Mechanism Design With Rich Private Information," Working Papers 2104E, University of Ottawa, Department of Economics.
    15. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.
    16. Takuma Wakayama, 2017. "Bribe-proofness for single-peaked preferences: characterizations and maximality-of-domains results," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 357-385, August.
    17. Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
    18. 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.
    19. James Schummer, 1999. "Almost-dominant Strategy Implementation," Discussion Papers 1278, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    20. Loertscher, Simon & Mezzetti, Claudio, 2021. "A dominant strategy, double clock auction with estimation-based tatonnement," Theoretical Economics, Econometric Society, vol. 16(3), July.

    More about this item

    Keywords

    Obvious Strategy-proofness Sequential Allotment Rules Division Problems Single-peaked Preferences;

    JEL classification:

    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations

    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:aoz:wpaper:49. 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: Laura Inés D Amato (email available below). General contact details of provider: https://edirc.repec.org/data/redniar.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.