We show how to a derive exact distribution-free nonparametric results for minimax risk when underlying random variables have known finite bounds and means are the only parameters of interest. Transform the data with a randomized mean preserving transformation into binary data and then apply the...

We select among rules for learning which of two actions in a stationary decision problem achieves a higher expected payo¤when payoffs realized by both actions are known in previous instances. Only a bounded set containing all possible payoffs is known. Rules are evaluated using maximum risk...

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

We extend the notions of evolutionary stability and, for the first time, that of neutral stability to asymmetric games played between two populations. Stability with respect to simultaneous entry of a small proportion of mutants into both populations is considered. Allocations where neither...

Games with multiple Nash equilibria are believed to be easier to play if players can communicate. We present a simple model of communication in games and investigate the importance of when communication takes place. Sending a message before play captures talk about intentions, after play...

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