There is a widespread hope that, in the near future, algorithms become so sophisticated that ``solutions" to most problems are found by machines. In this note, we throw some doubts on this expectation by showing the following impossibility result: given a set of finite-memory, finite-iteration...

In this paper we investigate how cognitive ability and character skills influence behavior, success and the evolution of play towards Nash equilibrium in repeated strategic interactions. We study behavior in a p-beauty contest experiment and find striking differences according to cognitive...

A learning rule is uncoupled if a player does not condition his strategy on the opponent's payoffs. It is radically uncoupled if a player does not condition his strategy on the opponent's actions or payoffs. We demonstrate a family of simple, radically uncoupled learning rules whose...

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...

We study two-player discounted repeated games in which one player cannot monitor the other unless he pays a fixed amount. It is well known that in such a model the folk theorem holds when the monitoring cost is on the order of magnitude of the stage payoff. We analyze high frequency games in...