under the profile after two distinct histories that agree in the last L periods is equal. Mailath and Morris (2002, 2006) proved that any strict equilibrium in bounded-recall strategies of a game with full support public monitoring is robust to all perturbations of the monitoring structure...

Much of the repeated game literature is concerned with proving Folk Theorems. The logic of the exercise is to specify a particular game, and to explore for that game specification whether any given feasible (and individually rational) value vector can be an equilibrium outcome for some...

A repeated game is where the stage game is repeated a number of times – the number of repetitions could be finite or infinite. We usually assume that (a) the stage game has a finite number of players, (b) for each player, the set of feasible actions for the stage game is finite, and (c) the...

We study two-player discounted repeated games in which one player cannot monitor the other unless he pays a fixed amount. It is well known that in such a model the folk theorem holds when the monitoring cost is on the order of magnitude of the stage payoff. We analyze high frequency games in...

We propose an extension to smooth fictitious play and prove that play converges to an ε-Markov perfect equilibrium with probability one in a class of stochastic games known as Markov potential games. We then prove a partial Folk theorem for repeated games under one-period perfect monitoring. We...

We present an algorithm to compute the set of perfect public equilibrium payoffs as the discount factor tends to one for stochastic games with observable states and public (but not necessarily perfect) monitoring when the limiting set of (long-run players') equilibrium payoffs is independent of...

We study the perfect type-contingently public ex-post equilibrium (PTXE) of repeated games with incomplete information where players observe imperfect public signals of the actions and the map from actions to signal distributions is itself unknown. The PTXE payoffs when players are patient are...

We present an algorithm to compute the set of perfect public equilibrium payoffs as the discount factor tends to one for stochastic games with observable states and public (but not necessarily perfect) monitoring when the limiting set of (long-run players') equilibrium payoffs is independent of...

We analyse finite two player games in which agents maximize given arbitrary private payoffs which we call ideologies. We define an equilibrium concept and prove existence. Based on this setup, a monotone evolutionary dynamic governs the distribution of ideologies within the population. For any...

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