We show that for many classes of symmetric two-player games, the simple decision rule "imitate-the-best" can hardly be beaten by any other decision rule. We provide necessary and sufficient conditions for imitation to be unbeatable and show that it can only be beaten by much in games that are of...

It is well known that the rock-paper-scissors game has no pure saddle point. We show that this holds more generally: A symmetric two-player zero-sum game has a pure saddle point if and only if it is not a generalized rock-paper-scissors game. Moreover, we show that every finite symmetric...

It is well known that the rock-paper-scissors game has no pure saddle point. We show that this holds more generally: A symmetric two-player zero-sum game has a pure saddle point if and only if it is not a generalized rock-paper-scissors game. Moreover, we show that every finite symmetric...

We show that for many classes of symmetric two-player games, the simple decision rule imitate-the-best can hardly be beaten by any other decision rule. We provide necessary and sufficient conditions for imitation to be unbeatable and show that it can only be beaten by much in games that are of...

Recently there has been much theoretical and experimental work on learning in games. However, learning usually means "learning about the strategic behavior of opponents" rather than "learning about the game" as such. In contrast, here we report on an experiment designed to test whether players...

Recently there has been much theoretical and experimental work on learning in games. However, learning usually means "learning about the strategic behavior of opponents" rather than "learning about the game" as such. In contrast, here we report on an experiment designed to test whether players...

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

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 John Nash’s proofs for the existence of (Nash) equilibria based on Brouwer’s theorem, an iteration mapping is used. A continuous—time analogue of the same mapping has been studied even earlier by Brown and von Neumann. This differential equation has recently been suggested as a...

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