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

Obvious Strategy-proofness with Respect to a Partition

Author

Listed:
  • R. Pablo Arribillaga
  • Jordi Massó
  • Alejandro Neme

Abstract

We define and study obvious strategy-proofness with respect to a partition of the set of agents. It encompasses strategy-proofness as a special case when the partition is the coarsest one and obvious strategy-proofness when the partition is the finest. For any partition, it falls between these two extremes. We establish two general properties of this new notion and apply it to the simple anonymous voting problem with two alternatives and strict preferences.

Suggested Citation

  • R. Pablo Arribillaga & Jordi Massó & Alejandro Neme, 2024. "Obvious Strategy-proofness with Respect to a Partition," Working Papers 1456, Barcelona School of Economics.
    • Handle: RePEc:bge:wpaper:1456
    as

    Download full text from publisher

    File URL: https://bse.eu/sites/default/files/working_paper_pdfs/1456.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    2. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2023. "All sequential allotment rules are obviously strategy-proof," Theoretical Economics, Econometric Society, vol. 18(3), July.
    3. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    4. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2020. "On obvious strategy-proofness and single-peakedness," Journal of Economic Theory, Elsevier, vol. 186(C).
    5. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.
    6. Peter Troyan, 2019. "Obviously Strategy‐Proof Implementation Of Top Trading Cycles," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 60(3), pages 1249-1261, August.
    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. Shengwu Li, 2024. "Designing Simple Mechanisms," Papers 2403.18694, arXiv.org, revised Jul 2024.
    2. 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).
    3. Louis Golowich & Shengwu Li, 2021. "On the Computational Properties of Obviously Strategy-Proof Mechanisms," Papers 2101.05149, arXiv.org, revised Oct 2022.
    4. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    5. Clayton Thomas, 2020. "Classification of Priorities Such That Deferred Acceptance is Obviously Strategyproof," Papers 2011.12367, arXiv.org, revised Feb 2021.
    6. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.
    7. Markus Möller, 2024. "Transparent Matching Mechanisms," ECONtribute Discussion Papers Series 306, University of Bonn and University of Cologne, Germany.
    8. Yannai A. Gonczarowski & Ori Heffetz & Clayton Thomas, 2022. "Strategyproofness-Exposing Mechanism Descriptions," Papers 2209.13148, arXiv.org, revised Jul 2023.
    9. Soo Hong Chew & Wenqian Wang, 2022. "Information Design of Dynamic Mechanisms," Papers 2205.10844, arXiv.org.
    10. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2020. "On obvious strategy-proofness and single-peakedness," Journal of Economic Theory, Elsevier, vol. 186(C).
    11. Alexander L. Brown & Daniel G. Stephenson & Rodrigo A. Velez, 2024. "Testing the simplicity of strategy-proof mechanisms," Papers 2404.11883, arXiv.org.
    12. Mandal, Pinaki & Roy, Souvik, 2020. "Obviously Strategy-proof Implementation of Assignment Rules: A New Characterization," MPRA Paper 104044, University Library of Munich, Germany.
    13. Mariya Halushka, 2021. "Obviously Strategy-proof Mechanism Design With Rich Private Information," Working Papers 2104E, University of Ottawa, Department of Economics.
    14. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2023. "All sequential allotment rules are obviously strategy-proof," Theoretical Economics, Econometric Society, vol. 18(3), July.
    15. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    16. Andrew Komo & Scott Duke Kominers & Tim Roughgarden, 2024. "Shill-Proof Auctions," Papers 2404.00475, arXiv.org.
    17. Sylvain Chassang & Lucia Del Carpio & Samuel Kapon, 2022. "Using Divide and Conquer to Improve Tax Collection: Theory and Laboratory Evidence," Working Papers 299, Princeton University, Department of Economics, Center for Economic Policy Studies..
    18. Núñez, Matías & Pimienta, Carlos & Xefteris, Dimitrios, 2022. "On the implementation of the median," Journal of Mathematical Economics, Elsevier, vol. 99(C).
    19. Tamura, Yuki, 2023. "Object reallocation problems with single-dipped preferences," Games and Economic Behavior, Elsevier, vol. 140(C), pages 181-196.
    20. Yannai A. Gonczarowski & Clayton Thomas, 2022. "Structural Complexities of Matching Mechanisms," Papers 2212.08709, arXiv.org, revised Mar 2024.

    More about this item

    Keywords

    obvious strategy-proofness; extended majority voting;

    JEL classification:

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

    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:bge:wpaper:1456. 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: Bruno Guallar (email available below). General contact details of provider: https://edirc.repec.org/data/bargses.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.