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

Competing Mechanisms in Games Played Through Agents: Theory and Experiment

Author

Listed:
  • Seungjin Han
  • Andrew Leal

Abstract

This paper proposes Competing Mechanism Games Played Through Agent (CMGPTA), an extension of the GPTA (Prat and Rustichini (2003)), where a Principal can offer any arbitrary mechanism that specifies a transfer schedule for each agent conditional on all Agents' messages. We identify the set of equilibrium allocations using deviator-reporting mechanisms (DRMs) on the path and single transfer schedules off the path. We design a lab experiment implementing DRMs. We observe that implemented outcomes are efficient more often than random. A majority of the time, Agents do tell the truth on the identity of a deviating Principal, despite potential gains from (tacit) collusion on false reports. As play progresses, Agents learn to play with their counterparty Agent with the average predicted probability of collusion on false reports across groups increasing from about 9% at the beginning of the experiment to just under 20% by the end. However, group heterogeneity is significant.

Suggested Citation

  • Seungjin Han & Andrew Leal, 2024. "Competing Mechanisms in Games Played Through Agents: Theory and Experiment," Papers 2403.03317, arXiv.org, revised Mar 2024.
    • Handle: RePEc:arx:papers:2403.03317
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Peters, Michael & Troncoso-Valverde, Cristián, 2013. "A folk theorem for competing mechanisms," Journal of Economic Theory, Elsevier, vol. 148(3), pages 953-973.
    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. Lester, Benjamin & Visschers, Ludo & Wolthoff, Ronald, 2015. "Meeting technologies and optimal trading mechanisms in competitive search markets," Journal of Economic Theory, Elsevier, vol. 155(C), pages 1-15.
    2. Larionov, Daniil & Pham, Hien & Yamashita, Takuro & Zhu, Shuguang, 2021. "First Best Implementation with Costly Information Acquisition," TSE Working Papers 21-1261, Toulouse School of Economics (TSE), revised Apr 2022.
    3. Attar, Andrea & Campioni, Eloisa & Mariotti, Thomas & Pavan, Alessandro, 2021. "Keeping the Agents in the Dark: Private Disclosures in Competing Mechanisms," TSE Working Papers 21-1227, Toulouse School of Economics (TSE), revised Dec 2023.
    4. Gorkem Celik & Michael Peters, 2016. "Reciprocal relationships and mechanism design," Canadian Journal of Economics/Revue canadienne d'économique, John Wiley & Sons, vol. 49(1), pages 374-411, February.
    5. Koessler, Frédéric & Lambert-Mogiliansky, Ariane, 2013. "Committing to transparency to resist corruption," Journal of Development Economics, Elsevier, vol. 100(1), pages 117-126.
    6. Philippe Jehiel & Laurent Lamy, 2018. "A Mechanism Design Approach to the Tiebout Hypothesis," Journal of Political Economy, University of Chicago Press, vol. 126(2), pages 735-760.
    7. Han Seungjin, 2016. "Sellers’ Implicit Collusion in Directed Search Markets," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 16(2), pages 711-738, June.
    8. James Albrecht & Pieter A. Gautier & Susan Vroman, 2014. "Efficient Entry in Competing Auctions," American Economic Review, American Economic Association, vol. 104(10), pages 3288-3296, October.
    9. Han, Seungjin, 2015. "Robust competitive auctions," Economics Letters, Elsevier, vol. 136(C), pages 207-210.
    10. Andrea Attar & Eloisa Campioni & Gwenaël Piaser & Uday Rajan, 2012. "Competing mechanism games of moral hazard: communication and robustness," Review of Economic Design, Springer;Society for Economic Design, vol. 16(4), pages 283-296, December.
    11. Han, Seungjin, 2014. "Implicit collusion in non-exclusive contracting under adverse selection," Journal of Economic Behavior & Organization, Elsevier, vol. 99(C), pages 85-95.
    12. Albrecht, James & Cai, Xiaoming & Gautier, Pieter & Vroman, Susan, 2020. "Multiple applications, competing mechanisms, and market power," Journal of Economic Theory, Elsevier, vol. 190(C).
    13. Seungjin Han, 2020. "Quasi Ex-Post Equilibrium in Competing Mechanisms," Department of Economics Working Papers 2020-11, McMaster University.
    14. Lester, Benjamin & Visschers, Ludo & Wolthoff, Ronald, 2014. "Meeting technologies and optimal trading mechanisms in competitive search markets," 2007 Annual Meeting, July 29-August 1, 2007, Portland, Oregon TN 2015-36, American Agricultural Economics Association (New Name 2008: Agricultural and Applied Economics Association).
    15. Han, Seungjin, 2012. "On take it or leave it offers in common agency," Economics Letters, Elsevier, vol. 117(3), pages 777-781.
    16. Seungjin Han, 2019. "General Competing Mechanisms with Frictions," Department of Economics Working Papers 2019-09, McMaster University.
    17. repec:ubc:pmicro:michael_peters-2015-8 is not listed on IDEAS
    18. Seungjin Han, 2015. "Competing Mechanisms: Theory and Applications in Directed Search Markets," Department of Economics Working Papers 2015-07, McMaster University, revised May 2016.
    19. Attar, Andrea & Campioni, Eloisa & Piaser, Gwenaël, 2019. "Private communication in competing mechanism games," Journal of Economic Theory, Elsevier, vol. 183(C), pages 258-283.
    20. Michael Peters, 2014. "Competing mechanisms," Canadian Journal of Economics/Revue canadienne d'économique, John Wiley & Sons, vol. 47(2), pages 373-397, May.
    21. Michael Peters & Balázs Szentes, 2012. "Definable and Contractible Contracts," Econometrica, Econometric Society, vol. 80(1), pages 363-411, January.

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