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 so place greater weight on recent experience, the time average of play often converges in these "unstable" games, even while mixed strategies and beliefs continue to cycle. This time average, the TASP, is related to the cycle identified by Shapley [L.S. Shapley, Some topics in two person games, in: M. Dresher, et al. (Eds.), Advances in Game Theory, Princeton University Press, Princeton, 1964]. The TASP can be close to or quite distinct from Nash equ...
Do boundedly rational players learn to choose equilibrium strategies as they play a game repeatedly?...
Consider a finite stage game G that is repeated infinitely often. At each time, the players have hyp...
Consider a finite stage game G that is repeated infinitely often. At each time, the players have hyp...
We report experiments studying mixed strategy Nash equilibria that are theoretically stable or unsta...
We report experiments designed to test between Nash equilibria that are stable and unstable under l...
We investigate games whose Nash equilibria are mixed and are unstable under fictitious play-like lea...
We report experiments designed to test between Nash equilibria that are stable and unstable under le...
We report experiments designed to test the theoretical possibility, first dis-covered by Shapley (19...
Abstract—Learning processes that converge to mixed-strategy equilibria often exhibit learning only i...
The paper studies the highly prototypical Fictitious Play (FP) algorithm, as well as a broad class o...
Although there exist learning processes for which the empirical distribution of play comes close to ...
The authors examine learning in all experiments they could locate involving one hundred periods or m...
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each ...
In the last ten years theory (e.g., Fudenberg and Levine, 1998) and empirical data fitting have pro...
This paper provides a genera1 framework to analyze rational learning in strategic situations where t...
Do boundedly rational players learn to choose equilibrium strategies as they play a game repeatedly?...
Consider a finite stage game G that is repeated infinitely often. At each time, the players have hyp...
Consider a finite stage game G that is repeated infinitely often. At each time, the players have hyp...
We report experiments studying mixed strategy Nash equilibria that are theoretically stable or unsta...
We report experiments designed to test between Nash equilibria that are stable and unstable under l...
We investigate games whose Nash equilibria are mixed and are unstable under fictitious play-like lea...
We report experiments designed to test between Nash equilibria that are stable and unstable under le...
We report experiments designed to test the theoretical possibility, first dis-covered by Shapley (19...
Abstract—Learning processes that converge to mixed-strategy equilibria often exhibit learning only i...
The paper studies the highly prototypical Fictitious Play (FP) algorithm, as well as a broad class o...
Although there exist learning processes for which the empirical distribution of play comes close to ...
The authors examine learning in all experiments they could locate involving one hundred periods or m...
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each ...
In the last ten years theory (e.g., Fudenberg and Levine, 1998) and empirical data fitting have pro...
This paper provides a genera1 framework to analyze rational learning in strategic situations where t...
Do boundedly rational players learn to choose equilibrium strategies as they play a game repeatedly?...
Consider a finite stage game G that is repeated infinitely often. At each time, the players have hyp...
Consider a finite stage game G that is repeated infinitely often. At each time, the players have hyp...