Individuals repeatedly face a multi-decision task with unknown payoff distributions. They have minimal memory and update their strategy by observing previous play (and not strategy) of someone else. We select behavior rules that increase average payoffs as often as possible in a large population...

The analysis of the replicator dynamic in generic perfect information games yields the following results. In the long run, players play a Nash equilibrium provided that initially all strategies are present. There is at most one ``stable'' component (formally, an interior asymptotically stable...