We illustrate one way in which a population of boundedly rational individuals can learn to play an approximate Nash equilibrium. Players are assumed to make strategy choices using a combination of imitation and innovation. We begin by looking at an imitation dynamic and provide conditions under...

A simple expression is derived for the optimal strategy in the minimum effort game. This maps from player beliefs to an optimal effort level. From this expression the set of Nash equilibria in the game is fully characterized. All Nash equilibria are symmetric and involve at most two actions...

We illustrate one way in which a population of boundedly rational individuals can learn to play an approximate Nash equilibrium. Players are assumed to make strategy choices using a combination of imitation and innovation. We begin by looking at an imitation dynamic and provide conditions under...

A simple expression is derived for the optimal strategy in the minimum effort game. This maps from player beliefs to an optimal effort level. From this expression the set of Nash equilibria in the game is fully characterized. All Nash equilibria are symmetric and involve at most two actions...