This paper investigates a class of population-learning dynamics. In every period agents either adopt a best reply to the current distribution of actual play, or a best reply to a sample, taken with replacement, from the distribution of intended play (the strategies adopted at the end of last period), or they are inactive. If sampling with replacement and being inactive have strictly positive probability, these dynamics converge globally to minimal curb sets in the absence of mistakes. For two-player i x j-games, i; j .le. 3; the same result holds even if only best responding to actual play and being inactive have positive probability. If players make mistakes in the implementation of their strategies, these dynamics select among minimal cur...
In imperfect-information games, a common assumption is that players can perfectly model the strategi...
Although there exist learning processes for which the empirical distribution of play comes close to ...
In this thesis we study the evolution of strategy choices for symmetric, finite, normal games. The s...
The paper develops a framework for the analysis of finite n-player games, recurrently played by rand...
This paper provides a genera1 framework to analyze rational learning in strategic situations where t...
Recent models of learning in games have attempted to produce individual-level learning algorithms th...
This dissertation contains four essays about evolutionary learning dynamics and the quantal response...
We analyze a population game as being constituted by a set of players, a normal form game and an int...
International audienceWe examine the long-run behavior of a wide range of dynamics for learning in n...
Consider a large population of individuals that are repeatedly randomly matched to play a cyclic 2 x...
Do boundedly rational players learn to choose equilibrium strategies as they play a game repeatedly?...
We study models of learning in games where agents with limited memory use social information to deci...
This paper presents a new, probabilistic model of learning in games. The model is set in the usual r...
We study how long it takes for large populations of interacting agents to come close to Nash equilib...
Abstract: We consider boundedly rational learning processes in which players have a priori limited s...
In imperfect-information games, a common assumption is that players can perfectly model the strategi...
Although there exist learning processes for which the empirical distribution of play comes close to ...
In this thesis we study the evolution of strategy choices for symmetric, finite, normal games. The s...
The paper develops a framework for the analysis of finite n-player games, recurrently played by rand...
This paper provides a genera1 framework to analyze rational learning in strategic situations where t...
Recent models of learning in games have attempted to produce individual-level learning algorithms th...
This dissertation contains four essays about evolutionary learning dynamics and the quantal response...
We analyze a population game as being constituted by a set of players, a normal form game and an int...
International audienceWe examine the long-run behavior of a wide range of dynamics for learning in n...
Consider a large population of individuals that are repeatedly randomly matched to play a cyclic 2 x...
Do boundedly rational players learn to choose equilibrium strategies as they play a game repeatedly?...
We study models of learning in games where agents with limited memory use social information to deci...
This paper presents a new, probabilistic model of learning in games. The model is set in the usual r...
We study how long it takes for large populations of interacting agents to come close to Nash equilib...
Abstract: We consider boundedly rational learning processes in which players have a priori limited s...
In imperfect-information games, a common assumption is that players can perfectly model the strategi...
Although there exist learning processes for which the empirical distribution of play comes close to ...
In this thesis we study the evolution of strategy choices for symmetric, finite, normal games. The s...