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 report experiments designed to test between Nash equilibria that are stable and unstable under learning. The 'TASP' (Time Average of the Shapley Polygon) gives a precise prediction about what happens when there is divergence from equilibrium under fictitious play like learning processes. We...

ROC curves from the signal detection literature are used in an evolutionary analysis of one-shot and repeated prisoners' dilemmas: showing if there is any discounting of future payoffs, or any cost of searching for an additional partner, then cooperative players who contingently participate - in...

ROC curves from the signal detection literature are used in an evolutionary analysis of one-shot and repeated prisoners' dilemmas: showing if there is any discounting of future payoffs, or any cost of searching for an additional partner, then cooperative players who contingently participate - in...

In this paper the well-known minimax theorems of Wald, Ville and Von Neumann are generalized under weaker topological conditions on the payoff function f and/or extended to the larger set of the Borel probability measures instead of the set of mixed strategies.

The equilibrium outcome of a strategic interaction between two or more people may depend on the weight they place on each other's payoff. A positive, negative or zero weight represents altruism, spite or complete selfishness, respectively. Paradoxically, the real, material payoff in equilibrium...

Suppose that individual payoffs depend on the network connecting them. Consider the following simultaneous move game of network formation: players announce independently the links they wish to form, and links are formed only under mutual consent. We provide necessary and sufficient conditions on...

Sets closed under rational behavior were introduced by Basu and Weibull (1991) as subsets of the strategy space that contain all best replies to all strategy profiles in the set. We here consider a more restrictive notion of closure under rational behavior: a subset of the strategy space is...

Tuning one's shower in some hotels may turn into a challenging coordination game with imperfect information. The temperature sensitivity increases with the number of agents, making the problem possibly unlearnable. Because there is in practice a finite number of possible tap positions, identical...