In John Nash’s proofs for the existence of (Nash) equilibria basedon Brouwer’s theorem, an iteration mapping is used. A continuous—time analogue of the same mapping has been studied even earlier byBrown and von Neumann. This differential equation has recently beensuggested as a plausible...

We report results of a series of experiments designed to test the stability of the best reply process. With linear demand and cost functions, the process is stable if and only if there are less than three firms in the market. However, we find no experimental evidence of such instability in a...

We show that in symmetric two-player exact potential games, the simple decision rule "imitate-if-better" cannot be beaten by any strategy in a repeated game by more than the maximal payoff difference of the one-period game. Our results apply to many interesting games including examples like 2x2...

We use an experiment to explore how subjects learn to play against computers which are programmed to follow one of a number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious play, imitation, reinforcement learning, and a trial...

In this note we study a very simple trial & error learning process in the context of a Cournot oligopoly. Without any knowledge of the payoff functions players increase, respectively decrease, their quantity by one unit as long as this leads to higher profits. We show that despite the absence of...

In this note we study a very simple trial & error learning process in the context of a Cournot oligopoly. Without any knowledge of the payoff functions players increase, respectively decrease, their quantity by one unit as long as this leads to higher profits. We show that despite the absence of...