Abstract
We provide necessary and sufficient conditions on players' preferences for a verifiable message game to possess a separating equilibrium and/or a pooling equilibrium, as well as sufficient conditions for every equilibrium of such a game to be pooling. We also characterize all nonseparating equilibria, and use this property to show that less information might be conveyed in any equilibrium of a verifiable message game than in some equilibrium of the cheap talk game with the same parameters.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
