Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/43778 
Year of Publication: 
2009
Series/Report no.: 
Working Papers No. 420
Publisher: 
Bielefeld University, Institute of Mathematical Economics (IMW), Bielefeld
Abstract: 
We study a communication game of common interest in which the sender observes one of infinite types and sends one of finite messages which is interpreted by the receiver. In equilibrium there is no full separation but types are clustered into convex categories. We give a full characterization of the strict Nash equilibria of this game by representing these categories by Voronoi languages. As the strategy set is infinite static stability concepts for finite games such as ESS are no longer sufficient for Lyapunov stability in the replicator dynamics. We give examples of unstable strict Nash equilibria and stable inefficient Voronoi languages. We derive efficient Voronoi languages with a large number of categories and numerically illustrate stability of some Voronoi languages with large message spaces and non-uniformly distributed types.
Subjects: 
Cheap talk
Signaling game
Communication game
Dynamic stability
Voronoi tesselation
JEL: 
C72
C73
D82
D83
Persistent Identifier of the first edition: 
Document Type: 
Working Paper

Files in This Item:
File
Size
731.11 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.