Consider a large population of individuals that are repeatedly randomly matched to play a cyclic 2x2 game such as Matching Pennies with fixed roles assigned in the game. Some learn by sampling previous play of a finite number of other individuals in the same role. We analyze population dynamics...

The effect that exogenous mistakes, made by players choosing their strategies, have on the dynamic stability for the replicator dynamic is analyzed for both asymmetric and symmetric normal form games. Through these perturbed games, the dynamic solution concept of limit asymptotic stability is...

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

The replicator equation model for the evolution of individual behaviors in a single-species with a multi-dimensional continuous trait space is developed as a dynamics on the set of probability measures. Stability of monomorphisms in this model using the weak topology is compared to more...

We consider the situation in which individuals in a finite population must repeatedly choose an action yielding an uncertain payoff. Between choices, each individual may observe the performance of one other individual. We search for rules of behavior with limited memory that increase expected...

We analyze the evolution of behavioral rules for learning how to play a two-armed bandit. Individuals have no information about the underlying pay-off distributions and have limited memory about their own past experience. Instead they must rely on information obtained trough observing the...

The evolutionary selection of outcomes (modelled using the replicator dynamics) in games with costless communication depends crucially on the structural assumptions made on the underlying population. (1) In conflicts between two interacting populations, common interest implies that the set of...

In consectutive rounds, each agent in a finite population chooses an action, is randomly matched, obtains a payoff and then observes the performance of another agent. An agent determines future behavior based on the information she receives from the present round. She chooses among the...