In this note we characterize the strategic implication of intrinsic correlation, introduced by Brandenburger and Friedenberg (2008), in the subjective correlated equilibrium setting of a complete information game. Intrinsic correlation restricts correlation devices to variables within the game,...

We show that every finite N-player normal form game possesses a correlated equilibrium with a precise lower bound on the number of outcomes to which it assigns zero probability. In particular, the largest games with a unique fully supported correlated equilibrium are two-player games; moreover,...

We propose a simple adaptive procedure for playing a game. In this procedure, players depart from their current play with probabilities that are proportional to measures of regret for not having used other strategies (these measures are updated every period). It is shown that our adaptive...

This paper establishes and interprets a necessary and sucient condition for existence of (countably additive) correlated equilibrium in n-person games, assuming only that utility functions are bounded, measurable. A sequence of deviation profiles is consistent if there exists a correlated...

This paper proposes new concepts of strong and coalition-proof correlated equilibria where agents form coalitions at the interim stage and share information about their recommendations in a credible way. When players deviate at the interim stage, coalition-proof correlated equilibria may fail to...

In this paper we study the effects of adding unmediated communication to static, finite games of complete and incomplete information. We characterize S^{U}(G), the set of outcomes of a game G, that are induced by sequential equilibria of cheap talk extensions. A cheap talk extension of G is an...

Nash equilibrium presumes that players have expected utility preferences, and therefore the beliefs of each player are represented by a probability measure. Motivated by Ellsberg-type behavior, which contradicts the probabilistic representation of beliefs, we generalize Nash equilibrium in...

We consider a random-matching model in which every agent has a categorization (partition) of his potential opponents. In equilibrium, the strategy of each player is a best response to the distribution of actions of his opponents in each category of his categorization. We provide equivalence...