In this paper we consider dynamic processes, in repeated games, that are subject to the natural informational restriction of uncoupledness. We study the almost sure convergence to Nash equilibria, and present a number of possibility and impossibility results. Basically, we show that if in...

Regret-based dynamics have been introduced and studied in the context of discrete-time repeated play. Here we carry out the corresponding analysis in continuous time. We observe that, in contrast to (smooth) fictitious play or to evolutionary models, the appropriate state space for this analysis...

In this paper we view bargaining and cooperation as an interaction superimposed on a strategic form game. A multistage bargaining procedure for N players, the "proposer commitment" procedure, is presented. It is inspired by Nash's two-player variable-threat model; a key feature is the commitment...

We call a dynamical system uncoupled if the dynamic for each player does not depend on the payoffs of the other players. We show that there are no uncoupled dynamics that are guaranteed to converge to Nash equilibrium, even when the Nash equilibrium is unique.

The authors present and analyze a model of noncooperative bargaining among n participants, applied to situations describable as games in coalitional form. This leads to a unified solution theory for such games that have as special cases the Shapley value in the transferable utility case, the...

This volume collects almost two decades of joint work of Sergiu Hart and Andreu Mas-Colell on game dynamics and equilibria. The starting point was the introduction of the adaptive strategy called <i>regret-matching</i>, which on the one hand is simple and natural, and on the other is shown to lead to...