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

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 this process converges...

The study of evolutionary dynamics was so far mainly restricted to finite strategy spaces. In this paper we show that this restriction is in most cases unnecessary. We give a mild condition under which the continuous time replicator dynamics are well defined for infinite strategy spaces....

Exploiting small uncertainties on the part of opponents, players in long, finitely repeated games can maintain false reputations that lead to a large variety of equilibrium outcomes. Even cooperation in a finitely repeated prisoners' dilemma is obtainable. Can such false reputations be...

Reinforcement learning has proved quite successful in predicting subjects' adjustment behaviour in repeatedly played simple games. However, reinforcement learning does not predict convergence to the efficient cell in the minimal information game of mutual fate control, while earlier...

Earlier experiments have shown that under little information subjects are hardly able to coordinate even though there are no conflicting interests and subjects are organised in fixed pairs. This is so, even though a simple adjustment process would lead the subjects into the efficient, fair and...

We ask whether communication can directly substitute for memory in dynastic repeated games in which short lived individuals care about the utility of their offspring who replace them in an infinitely repeated game. Each individual is unable to observe what happens before his entry in the game....

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

We show in this paper that none of the existing static evolutionary stability concepts (ESS, CSS, uninvadability, NIS) is sufficient to guarantee dynamic stability in the weak topology with respect to standard evolutionary dynamics if the strategy space is continuous. We propose a new concept,...

In a recent paper Bagwell (1995) pointed out that only the Cournot outcome, but not the Stackelberg outcome, can be supported by a pure Nash equilibrium when actions of the Stackelberg leader are observed with the slightest error. The Stackelberg outcome, however, remains close to the outcome of...