Communication, Correlation and Cheap-Talk in Games with Public Information
Yuval Heller, Eilon Solan, Tristan Tomala
Abstract
Open-access reader
Yuval Heller, Eilon Solan, Tristan Tomala
Abstract
Open-access reader
This paper studies extensive form games with perfect information and simultaneous moves, henceforth called games with public information. On this class, we prove that all communication equilibrium payoffs can be obtained without mediator by cheap-talk procedures. The result encompasses repeated games and stochastic games.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper studies extensive form games with perfect information and simultaneous moves, henceforth called games with public information. On this class, we prove that all communication equilibrium payoffs can be obtained without mediator by cheap-talk procedures. The result encompasses repeated games and stochastic games.
Key concepts: Cheap talk, Mathematical economics, Class (philosophy), Repeated game, Computer science, Information transmission, Extensive-form game, Turns, rounds and time-keeping systems in games