We study population game dynamics under which each revising agent tests each of his strategies a fixed number of times, with each play of each strategy being against a newly drawn opponent, and chooses the strategy whose total payoff was highest. In the Centipede game, these best experienced...

I analyze sequential auctions with expectations-based loss-averse bidders who have independent private values and unit demand. Equilibrium bids are history dependent and subject to a discouragement effect: the higher the winning bid in the current round is, the less aggressive the bids of the...

It is widely known that loss aversion leads individuals to dislike risk, and as has been argued by many researchers, in many instances this creates an incentive for firms to shield consumers and employees against economic risks. Complementing previous research, we show that consumer loss...

We study optimal price discrimination when a monopolist faces a continuum of consumers with reference-dependent preferences. A consumer's valuation for product quality consists of an intrinsic valuation affected by a private state signal (type), and a gain-loss valuation that depends on...

We study optimal price discrimination when a monopolist faces a continuum of consumers with reference-dependent preferences. A consumer's valuation for product quality consists of an intrinsic valuation affected by a private state signal (type), and a gain-loss valuation that depends on...

It is widely known that loss aversion leads individuals to dislike risk, and as has been argued by many researchers, in many instances this creates an incentive for firms to shield consumers and employees against economic risks. Complementing previous research, we show that consumer loss...

We introduce a game-theoretic model with switching costs and endogenous references. An agent endogenizes his reference strategy and then, taking switching costs into account, he selects a strategy from which there is no profitable deviation. We axiomatically characterize this selection procedure...

We study the design of mechanisms that implement Lindahl or Walrasian allocations and whose Nash equilibria are dynamically stable for a wide class of adaptive dynamics. We argue that supermodularity is not a desirable stability criterion in this mechanism design context, focusing instead on...

We study the design of mechanisms that implement Lindahl or Walrasian allocations and whose Nash equilibria are dynamically stable for a wide class of adaptive dynamics. We argue that supermodularity is not a desirable stability criterion in this mechanism design context, focusing instead on...

This paper extends Milgrom and Robert's treatment of supermodular games in two ways. It points out that their main characterization result holds under a weaker assumption. It refines the arguments to provide bounds on the set of strategies that survive iterated deletion of weakly dominated...