In the past, many refinements have been proposed to select equilibria in cheap talk games. Usually, these refinements were motivated by a discussion of how rational agents would reason in some particular cheap talk games. In this paper, we propose a new refinement and stability measure that is...

We consider mechanism design in contexts in which agents exhibit bounded depth of reasoning (level k ) instead of rational expectations. We use simple direct mechanisms, in which agents report only first-order beliefs. While level 0 agents are assumed to be truth tellers, level k agents...

Riley (1979)'s reactive equilibrium concept addresses problems of equilibrium existence in competitive markets with adverse selection. The game-theoretic interpretation of the reactive equilibrium concept in Engers and Fernandez (1987) yields the Rothschild-Stiglitz (1976)/Riley (1979)...

This paper studies a contest in which players with unobservable types may form an alliance in a pre-stage of the game to join their forces and compete for a prize. We characterize the pure strategy equilibria of this game of incomplete information. We show that if the formation of an alliance is...

This is a brief survey describing some of the recent progress and open problems in the area of cooperative games with incomplete information. We discuss exchange economies, cooperative Bayesian games with orthogonal coalitions, and issues of cooperation in non-cooperative Bayesian games. --...

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

Recent literature has questioned the existence of a learning foundation for the partially cursed equilibrium. This paper closes the gap by showing that a partially cursed equilibrium corresponds to a particular analogy-based expectation equilibrium. -- Analogy expectations ; bounded rationality...

Two individuals are involved in a conflict situation in which preferences are ex ante uncertain. While they eventually learn their own preferences, they have to pay a small cost if they want to learn their opponent's preferences. We show that, for sufficiently small positive costs of information...

Currently no refinement exists that successfully selects equilibria across a wider range of Cheap Talk games. We propose a generalization of refinements based on credible deviations, such as neologism proofness and announcement proofness. According to our Average Credible Deviation Criterion...