In a class of informed principal problems with common values, we define iteratively a particular allocation which we call the assured allocation. It is comparatively easy to calculate and straightforward to interpret. It always exists, is unique and continuous in the priors. It is undominated,...

We study a class of population games called stable games. These games are characterized by self-defeating externalities: when agents revise their strategies, the improvements in the payoffs of strategies to which revising agents are switching are always exceeded by the improvements in the...

We propose a new concept for the analysis of games, the TASP, which gives a precise prediction about non-equilibrium play in games whose Nash equilibria are mixed and are unstable under fictitious play-like learning. We show that, when players learn using weighted stochastic fictitious play and...

We study symmetric play in a class of repeated games when players are patient. We show that, while the use of symmetric strategy profiles essentially does not restrict the set of feasible payoffs, the set of equilibrium payoffs is an interesting proper subset of the feasible and individually...

We provide a general formal framework to define and analyze the concepts of focal points and frames for normal form games. The information provided by a frame is captured by a symmetry structure which is consistent with the payoff structure of the game. The set of symmetry structures has itself...