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

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 evolutionary basis for predicting the backwards induction solution in generic finite extensive-form games with perfect information is examined. Evolution is modelled using the replicator dynamic in combination with rare mutations that introduce a small change in the proportion of each...

We consider the model of social learning by Schlag (1996). Individuals must repeatedly choose an action in a multi-armed bandit. We assume that each indivdiual observes the outcomes of two other individuals' choices before her own next choice must be made -- the original model only allows for...

It is well known for the common multi-population evolutionary dynamics applied to normal form games that a pure strategy combination is asymptotically stable if and only if it is a strict equilibrium point. We extend this result to sets as follows. For certain regular selection dynamics every...

Consider a contest for a prize in which each player knows his/her own ability, but may or may not know those of his/her rivals (the complete or incomplete information regimes). Our main result is that, if the value of the prize is high, more effort and output are engendered under incomplete...

Aim: To present a systematic development of the theory of combinatorial games from the ground up. Approach: Computational complexity. Combinatorial games are completely determined; the questions of interest are efficiencies of strategies. Methodology: Divide and conquer. Ascend from Nim to Chess...