In a recent paper, Jäger, Metzger, and Riedel (2011) study communication games of common interest when signals are simple and types complex. They characterize strict Nash equilibria as so-called Voronoi languages that consist of Voronoi tesselations of the type set and Bayesian estimators on...

In a recent paper, Jäger, Metzger, and Riedel (2011) study communication games of common interest when signals are simple and types complex. They characterize strict Nash equilibria as so–called Voronoi languages that consist of Voronoi tesselations of the type set and Bayesian estimators on...

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...

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...

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...