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

Renegotiation-Proof Cheap Talk

Author

Listed:
  • Steven Kivinen
  • Christoph Kuzmics

Abstract

An informed Advisor and an uninformed Decision-Maker engage in repeated cheap talk communication in always new (stochastically independent) decision problems. They have a conflict of interest over which action should be implemented at least in some cases. Our main result is that, while the Decision-Maker's optimal payoff is attainable in some subgame perfect equilibrium (by force of the usual folk theorem), no payoff profile close to the Decision-Maker's optimal one is immune to renegotiation. Pareto efficient renegotiation-proof equilibria are typically attainable, and they entail a compromise between the Advisor and the Decision-Maker. This could take the form of the Advisor being truthful and the Decision-Maker not utilizing this information to their own full advantage, or the Advisor being somewhat liberal with the truth and the Decision-Maker, while fully aware of this, pretending to believe the Advisor.

Suggested Citation

  • Steven Kivinen & Christoph Kuzmics, 2025. "Renegotiation-Proof Cheap Talk," Papers 2502.08296, arXiv.org.
    • Handle: RePEc:arx:papers:2502.08296
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Green, Jerry R. & Stokey, Nancy L., 2007. "A two-person game of information transmission," Journal of Economic Theory, Elsevier, vol. 135(1), pages 90-104, July.
    2. Mailath, George J. & Samuelson, Larry, 2006. "Repeated Games and Reputations: Long-Run Relationships," OUP Catalogue, Oxford University Press, number 9780195300796, Decembrie.
    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. Kuvalekar, Aditya & Lipnowski, Elliot & Ramos, João, 2022. "Goodwill in communication," Journal of Economic Theory, Elsevier, vol. 203(C).
    2. Juan‐Pablo Montero & Juan Ignacio Guzman, 2010. "Output‐Expanding Collusion In The Presence Of A Competitive Fringe," Journal of Industrial Economics, Wiley Blackwell, vol. 58(1), pages 106-126, March.
    3. Tobias Salz & Emanuel Vespa, 2020. "Estimating dynamic games of oligopolistic competition: an experimental investigation," RAND Journal of Economics, RAND Corporation, vol. 51(2), pages 447-469, June.
    4. Daron Acemoglu & Matthew O. Jackson, 2017. "Social Norms and the Enforcement of Laws," Journal of the European Economic Association, European Economic Association, vol. 15(2), pages 245-295.
    5. Kimmo Berg & Gijs Schoenmakers, 2017. "Construction of Subgame-Perfect Mixed-Strategy Equilibria in Repeated Games," Games, MDPI, vol. 8(4), pages 1-14, November.
    6. , & ,, 2015. "A folk theorem for stochastic games with infrequent state changes," Theoretical Economics, Econometric Society, vol. 10(1), January.
    7. Ernesto Dal Bó & Pedro Dal Bó & Rafael Di Tella, 2007. "Reputation When Threats and Transfers Are Available," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 16(3), pages 577-598, September.
    8. Carmona, Guilherme & Carvalho, Luís, 2016. "Repeated two-person zero-sum games with unequal discounting and private monitoring," Journal of Mathematical Economics, Elsevier, vol. 63(C), pages 131-138.
    9. Bramoullé, Yann & Goyal, Sanjeev, 2016. "Favoritism," Journal of Development Economics, Elsevier, vol. 122(C), pages 16-27.
    10. Sander Heinsalu, 2018. "Corrigendum to "Managerial Incentive Problems: A Dynamic Perspective"," Papers 1811.00455, arXiv.org, revised Nov 2018.
    11. Nicolas Vieille, 2010. "Recursive Methods in Discounted Stochastic Games: An Algorithm for - 1 and a Folk Theorem," Post-Print hal-00543616, HAL.
    12. Christian Hilbe & Moshe Hoffman & Martin A. Nowak, 2015. "Cooperate without Looking in a Non-Repeated Game," Games, MDPI, vol. 6(4), pages 1-15, September.
    13. Strobl, Günter, 2022. "A theory of procyclical market liquidity," Journal of Economic Dynamics and Control, Elsevier, vol. 138(C).
    14. , & , M. & ,, 2013. "Hierarchical cheap talk," Theoretical Economics, Econometric Society, vol. 8(1), January.
    15. Larionov, Daniil, 2023. "Full surplus extraction from colluding bidders," ZEW Discussion Papers 23-029, ZEW - Leibniz Centre for European Economic Research.
    16. Giovanni Immordino, 2005. "Uncertainty and the Cost of Reversal," The Geneva Risk and Insurance Review, Palgrave Macmillan;International Association for the Study of Insurance Economics (The Geneva Association), vol. 30(2), pages 119-128, December.
    17. Loukas Dimitriou & Theodore Tsekeris, 2009. "Evolutionary game-theoretic model for dynamic congestion pricing in multi-class traffic networks," Netnomics, Springer, vol. 10(1), pages 103-121, April.
    18. , H. & ,, 2016. "Approximate efficiency in repeated games with side-payments and correlated signals," Theoretical Economics, Econometric Society, vol. 11(1), January.
    19. Matsushima Hitoshi, 2020. "Behavioral Theory of Repeated Prisoner’s Dilemma: Generous Tit-For-Tat Strategy," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 20(1), pages 1-11, January.
    20. Alcalde, Pilar & Vial, Bernardita, 2016. "Willingness to Pay for Firm Reputation: Paying for Risk Rating in the Annuity Market," MPRA Paper 68993, University Library of Munich, Germany.

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