arXiv · 2309.04193
Robust equilibria in cheap-talk games with fairly transparent motives
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jan-Henrik Steg, Elshan Garashli, Michael Greinecker, Christoph Kuzmics. 2024-03-15. Robust equilibria in cheap-talk games with fairly transparent motives. https://arxiv.org/abs/2309.04193
Cite the original work for its findings. Save a collection to share your selection of sources.