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

We study sequential search without priors. Our interest lies in decision rules that are close to being optimal under each prior and after each history. We call these rules robust. The search literature employs optimal rules based on cutoff strategies, and these rules are not robust. We derive...

This paper introduces the concept of ordient for binary relations (preferences), a relative of the concept of gradients for functions (utilities). The lexicographic order, albeit not representable, has an ordient. Not only binary relations representable by differentiable functions have an...

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

This note studies the problem of implementing social choice correspondences in environments where individuals have doubts about the rationality of their opponents. We postulate the concept of "-minimax regret as our solution concept and show that social choice correspondences that are Maskin...

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

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