We show that a set of outcomes outside the convex hull of Nash equilibria can be asymptotically stable with respect to convex monotonic evolutionary dynamics. Boundedly rational agents receive signals and condition the choice of strategies on the signals. A set of conditional strategies is...

This paper studies the problem of identifying and estimating the normal-form payoff parameters of a simultaneous, discrete game of complete information where the equilibrium concept employed is correlated equilibrium rather than Nash equilibrium. We show that once we extend the equilibrium...

This paper provides an explicit characterization of correlations that are implicitly captured by partition models for incomplete information games. The main result of this paper shows that every partition model for incomplete information can be decomposed into the conjunctions of a unique...

A game of incomplete information can be decomposed into a basic game and an information structure. The basic game defines the set of actions, the set of payoff states the payoff functions and the common prior over the payoff states. The information structure refers to the signals that the...

It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic leading to Nash equilibrium in all finite games that a...

The paper studies the structure of the set of correlated equilibria for 2x2-bimatrix games. We find that the extreme points of the (convex) set of correlated equilibria can be determined very easily from the Nash equilibria of the game.

We extend Aumann's [3] theorem, deriving correlated equilibria as a consequence of common priors and common knowledge of rationality, by explicitly allowing for non-rational behavior. We replace the assumption of common knowledge of rationality with a substantially weaker one, joint p-belief of...

We study an interactive framework that explicitly allows for non-rational behavior. We do not place any restrictions on how players can deviate from rational behavior. Instead we assume that there exists a lower bound p 2 [0; 1] such that all players play and are believed to play rationally with...

Congestion games are multi-player games in which players' costs are additive over a set of resources that have anonymous cost functions, with pure strategies corresponding to certain subsets of resources. In a splittable congestion game, each player can choose a convex combination of subsets of...

We study an interactive framework that explicitly allows for non-rational behavior. We do not place any restrictions on how players can deviate from rational behavior. Instead we assume that there exists a lower bound p E [0,1] such that all players play and are believed to play rationally with...