Robust equilibria in cheap-talk games with fairly transparent motives
classification
💰 econ.TH
keywords
robustequilibriacheap-talkgamessenderachievedalwaysbinary
read the original abstract
For cheap-talk games with a binary state space in which the sender has state-independent preferences, we characterize equilibria that are robust to introducing slight state-dependence on the side of the sender. Not all equilibria are robust, but the sender-optimum is always achieved at some robust equilibrium.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.