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

On the Dominance of Truth-Telling in Gradual Mechanisms

Author

Listed:
  • Wenqian Wang
  • Zhiwen Zheng

Abstract

Recent literature highlights the advantages of implementing social rules via dynamic game forms. We characterize when truth-telling remains a dominant strategy in gradual mechanisms implementing strategy-proof social rules, where agents gradually reveal their private information while acquiring information about others in the process. Our first characterization hinges on the incentive-preservation of a basic transformation on gradual mechanisms called illuminating that partitions information sets. The second relies on a single reaction-proofness condition. We demonstrate the usefulness of both characterizations through applications to second-price auctions and the top-trading cycles algorithm.

Suggested Citation

  • Wenqian Wang & Zhiwen Zheng, 2025. "On the Dominance of Truth-Telling in Gradual Mechanisms," Papers 2501.08802, arXiv.org.
    • Handle: RePEc:arx:papers:2501.08802
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Rothkopf, Michael H. & Harstad, Ronald M., 1994. "On the role of discrete bid levels in oral auctions," European Journal of Operational Research, Elsevier, vol. 74(3), pages 572-581, May.
    2. Bonanno, G, 1992. "Set-Theoretic Equivalence of Extensive-Form Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(4), pages 429-447.
    3. Elmes Susan & Reny Philip J., 1994. "On the Strategic Equivalence of Extensive Form Games," Journal of Economic Theory, Elsevier, vol. 62(1), pages 1-23, February.
    4. Mohammad Akbarpour & Shengwu Li, 2020. "Credible Auctions: A Trilemma," Econometrica, Econometric Society, vol. 88(2), pages 425-467, March.
    5. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.
    6. Martin J. Osborne & Ariel Rubinstein, 1994. "A Course in Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262650401, December.
    7. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    8. Barbera Salvador & Gul Faruk & Stacchetti Ennio, 1993. "Generalized Median Voter Schemes and Committees," Journal of Economic Theory, Elsevier, vol. 61(2), pages 262-289, December.
    9. 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.
    10. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    11. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
    12. Kohlberg, Elon & Mertens, Jean-Francois, 1986. "On the Strategic Stability of Equilibria," Econometrica, Econometric Society, vol. 54(5), pages 1003-1037, September.
    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. Soo Hong Chew & Wenqian Wang, 2022. "Information Design of Dynamic Mechanisms," Papers 2205.10844, arXiv.org.
    2. Battigalli, Pierpaolo & Leonetti, Paolo & Maccheroni, Fabio, 2020. "Behavioral equivalence of extensive game structures," Games and Economic Behavior, Elsevier, vol. 121(C), pages 533-547.
    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. Andrew Komo & Scott Duke Kominers & Tim Roughgarden, 2024. "Shill-Proof Auctions," Papers 2404.00475, arXiv.org, revised Nov 2024.
    5. Peter A. Streufert, 2020. "The Category of Node-and-Choice Extensive-Form Games," University of Western Ontario, Departmental Research Report Series 20204, University of Western Ontario, Department of Economics.
    6. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    7. Louis Golowich & Shengwu Li, 2021. "On the Computational Properties of Obviously Strategy-Proof Mechanisms," Papers 2101.05149, arXiv.org, revised Oct 2022.
    8. Mariya Halushka, 2021. "Obviously Strategy-proof Mechanism Design With Rich Private Information," Working Papers 2104E, University of Ottawa, Department of Economics.
    9. Mackenzie, Andrew, 2020. "A revelation principle for obviously strategy-proof implementation," Games and Economic Behavior, Elsevier, vol. 124(C), pages 512-533.
    10. Rodrigo A. Velez & Alexander L. Brown, 2019. "Empirical strategy-proofness," Papers 1907.12408, arXiv.org, revised Jul 2020.
    11. 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.
    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. 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..
    14. Cramton, Peter C, 1995. "Money Out of Thin Air: The Nationwide Narrowband PCS Auction," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 4(2), pages 267-343, Summer.
    15. Anderson, E. & Holmberg, P., 2023. "Multi-unit auctions with uncertain supply and single-unit demand," Cambridge Working Papers in Economics 2339, Faculty of Economics, University of Cambridge.
    16. Ehud Kalai & Dov Samet, 1986. "Are Bayesian-Nash Incentives and Implementations Perfect?," Discussion Papers 680, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    17. Shani Cohen & Shengwu Li, 2022. "Sequential Cursed Equilibrium," Papers 2212.06025, arXiv.org, revised Aug 2023.
    18. Söllner, Matthias, 2008. "Menschliches Verhalten in elektronischen Märkten," Bayreuth Reports on Information Systems Management 34, University of Bayreuth, Chair of Information Systems Management.
    19. Shengwu Li, 2024. "Designing Simple Mechanisms," Papers 2403.18694, arXiv.org, revised Jul 2024.
    20. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.

    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:2501.08802. 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.