IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2101.05149.html
   My bibliography  Save this paper

On the Computational Properties of Obviously Strategy-Proof Mechanisms

Author

Listed:
  • Louis Golowich
  • Shengwu Li

Abstract

We present a polynomial-time algorithm that determines, given some choice rule, whether there exists an obviously strategy-proof mechanism for that choice rule.

Suggested Citation

  • Louis Golowich & Shengwu Li, 2021. "On the Computational Properties of Obviously Strategy-Proof Mechanisms," Papers 2101.05149, arXiv.org, revised Oct 2022.
    • Handle: RePEc:arx:papers:2101.05149
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2101.05149
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2020. "On obvious strategy-proofness and single-peakedness," Journal of Economic Theory, Elsevier, vol. 186(C).
    2. Schneider, Mark & Porter, David, 2020. "Effects of experience, choice architecture, and cognitive reflection in strategyproof mechanisms," Journal of Economic Behavior & Organization, Elsevier, vol. 171(C), pages 361-377.
    3. M. Kathleen Ngangoué & Georg Weizsäcker, 2021. "Learning from Unrealized versus Realized Prices," American Economic Journal: Microeconomics, American Economic Association, vol. 13(2), pages 174-201, May.
    4. 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.
    5. Bade, Sophie, 2019. "Matching with single-peaked preferences," Journal of Economic Theory, Elsevier, vol. 180(C), pages 81-99.
    6. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2023. "All sequential allotment rules are obviously strategy-proof," Theoretical Economics, Econometric Society, vol. 18(3), July.
    7. McGee, Peter & Levin, Dan, 2019. "How obvious is the dominant strategy in an English Auction? Experimental evidence," Journal of Economic Behavior & Organization, Elsevier, vol. 159(C), pages 355-365.
    8. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    9. Myerson, Roger B, 1979. "Incentive Compatibility and the Bargaining Problem," Econometrica, Econometric Society, vol. 47(1), pages 61-73, January.
    10. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.
    11. Mandal, Pinaki & Roy, Souvik, 2020. "Obviously Strategy-proof Implementation of Assignment Rules: A New Characterization," MPRA Paper 104044, University Library of Munich, Germany.
    12. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    13. Kagel, John H & Levin, Dan, 2001. "Behavior in Multi-unit Demand Auctions: Experiments with Uniform Price and Dynamic Vickrey Auctions," Econometrica, Econometric Society, vol. 69(2), pages 413-454, March.
    14. Kagel, John H & Harstad, Ronald M & Levin, Dan, 1987. "Information Impact and Allocation Rules in Auctions with Affiliated Private Values: A Laboratory Study," Econometrica, Econometric Society, vol. 55(6), pages 1275-1304, November.
    15. Jason D. Hartline & Brendan Lucier, 2015. "Non-optimal Mechanism Design," American Economic Review, American Economic Association, vol. 105(10), pages 3102-3124, October.
    16. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
    17. Ignacio Esponda Jr. & Emanuel Vespa Jr., 2014. "Hypothetical Thinking and Information Extraction in the Laboratory," American Economic Journal: Microeconomics, American Economic Association, vol. 6(4), pages 180-202, November.
    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. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    4. Yves Breitmoser & Sebastian Schweighofer-Kodritsch, 2022. "Obviousness around the clock," Experimental Economics, Springer;Economic Science Association, vol. 25(2), pages 483-513, April.
    5. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    6. 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).
    7. Alexander L. Brown & Daniel G. Stephenson & Rodrigo A. Velez, 2024. "Testing the simplicity of strategy-proof mechanisms," Papers 2404.11883, arXiv.org.
    8. Clayton Thomas, 2020. "Classification of Priorities Such That Deferred Acceptance is Obviously Strategyproof," Papers 2011.12367, arXiv.org, revised Feb 2021.
    9. Mariya Halushka, 2021. "Obviously Strategy-proof Mechanism Design With Rich Private Information," Working Papers 2104E, University of Ottawa, Department of Economics.
    10. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.
    11. Moser, Johannes, 2018. "Hypothetical thinking and the winner's curse: An experimental investigation," VfS Annual Conference 2018 (Freiburg, Breisgau): Digital Economy 181506, Verein für Socialpolitik / German Economic Association.
    12. 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.
    13. Takehito Masuda & Ryo Mikami & Toyotaka Sakai & Shigehiro Serizawa & Takuma Wakayama, 2022. "The net effect of advice on strategy-proof mechanisms: an experiment for the Vickrey auction," Experimental Economics, Springer;Economic Science Association, vol. 25(3), pages 902-941, June.
    14. 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..
    15. Tamura, Yuki, 2023. "Object reallocation problems with single-dipped preferences," Games and Economic Behavior, Elsevier, vol. 140(C), pages 181-196.
    16. Johannes Moser, 2017. "Hypothetical thinking and the winner's curse: An experimental investigation," Working Papers 176, Bavarian Graduate Program in Economics (BGPE).
    17. Arribillaga, R. Pablo & Massó, Jordi & Neme, Alejandro, 2020. "On obvious strategy-proofness and single-peakedness," Journal of Economic Theory, Elsevier, vol. 186(C).
    18. Moser, Johannes, 2017. "Hypothetical thinking and the winner's curse: An experimental investigation," University of Regensburg Working Papers in Business, Economics and Management Information Systems 36304, University of Regensburg, Department of Economics.
    19. Takehito Masuda & Ryo Mikami & Toyotaka Sakai & Shigehiro Serizawa & Takuma Wakayama, 2020. "The net effect of advice on strategy-proof mechanisms: An experiment for the Vickrey auction," ISER Discussion Paper 1109r, Institute of Social and Economic Research, Osaka University, revised May 2021.
    20. Sylvain Chassang & Lucia Del Carpio & Samuel Kapon, 2020. "Making the Most of Limited Government Capacity: Theory and Experiment," Working Papers 2020-7, Princeton University. Economics Department..

    More about this item

    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:arx:papers:2101.05149. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.