Summary. Recent literature in the theory of dynamic games addresses renegotiatioin-proof equilibria, For repeated games, I analyze the limit of renegotiation-proof equilibrium sets as discounting vanishes. The main result states that such limit sets must either be singletons or belong to the Pareto frontier of the convex hull of the feasible set of the stage game payoffs.
(with Jon Bendor and Dilip Mookherjee), Advances in Theoretical Economics1, Issue 1, Article 3. Additional notes on extending the model to the probabilistic choice framework of Luce.
Summary. We study long run implications of reinforcement learning when two players repeatedly interact with one another over multiple rounds to play a finite action game. Within each round, the players play the game many successive times with a fixed set of aspirations used to evaluate payoff experiences as successes or failures. The probability weight on successful actions is increased, while failures result in players trying alternative actions in subsequent rounds. The learning rule is supplemented by small amounts of inertia and random perturbations to the states of players. Aspirations are adjusted across successive rounds on the basis of the discrepancy between the average payoff and aspirations in the most recently concluded round. We define and characterize pure steady states of this model, and establish convergence to these under appropriate conditions.
Summary. We introduce a new solution concept for transferable-utility games in characteristic function form, when individuals collectively believe in equality as a desirable social goal, although in their private actions they behave selfishly. This latter consideration implies that an “egalitarian solution” must satisfy core-like participation constraints, while the former implies that such a solution is also a Lorenz-maximal element of the constrained set. Despite the well-known fact that the Lorenz ordering is incomplete, we show that the egalitarian solution is unique whenever it exists.