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 analyze the role of commitment in pre-play communication for ensuring efficient evolutionarily stable outcomes in coordination games. All players are a priori identical as they are drawn from the same population. In games where efficient outcomes can be reached by players coordinating on the...

We consider the problem of pricing a single object when the seller has only minimal information about the true valuation of the buyer. Specifically, the seller only knows the support of the possible valuations and has no further distributional information. The seller is solving this choice...

This paper introduces a new solution concept, a minimax regret equilibrium, which allows for the possibility that players are uncertain about the rationality and conjectures of their opponents. We provide several applications of our concept. In particular, we consider price-setting environments...

consider an N-player normal form game played repeatedly in which each player should choose each strategy exactly one time (payoffs are aggregated). such "play only once" situations occur naturally in the context of scheduling. assume that each player has the same number of strategies. Then,...

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

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

We call a set of strategies "uniformly evolutionary stable" if the following holds after a small mutation of a monomorphic population playing a strategy in the set: a) No mutant strategy can spread. b) Mutant strategies not in the set will be driven out. c) The meaning of a "small mutation" can...