Sets closed under rational behavior were introduced by Basu and Weibull (1991) as subsets of the strategy space that contain all best replies to all strategy profiles in the set. We here consider a more restrictive notion of closure under rational behavior: a subset of the strategy space is...

In a strategic game, a curb set [Basu and Weibull, Econ. Letters 36 (1991) 141] is a product set of pure strategies containing all best responses ro every possible belief restricted to this set. Prep sets [Voorneveld, Games Econ. Behav. 48 (2004) 403] relax this condition by only requiring the...

In this paper I define an evolutionary stability criterion for learning rules. Using Monte Carlo simulations, I then apply this criterion to a class of learning rules that can be represented by Camerer and Ho's (1999) model of learning. This class contains perturbed versions of reinforcement and...

This paper examines the effects of search costs on prices in a Bertrand duopoly. It is shown that if the search cost is lowered, the expected price goes down in a single play of the stage game. However, if the game is repeated it may be easier to sustain collusion the lower the search cost. In...

In this paper, I analyze stochastic adaptation in finite n-player games played by heterogeneous populations of myopic best repliers, better repliers and imitators. In each period, one individual from each of n populations, one for each player role, is drawn to play and chooses a pure strategy...

In this paper we model an evolutionary process with perpetual random shocks where individual behavior is determined by imitation. Every period an agent is randomly chosen from each of n finite populations to play a game. Each agent observes a sample of population-specific past strategy and...

This paper characterizes the unique Markov equilibrium in the sequential move, finite horizon pricing duopoly with discounting. Simple, short cycles repeat until the last two periods. For discount factors above 0.75488, there are three-period reaction function cycles and below 0.75488,...

In Young (1993, 1998) agents are recurrently matched to play a finite game and almost always play a myopic best reply to a frequency distribution based on a sample from the recent history of play. He proves that in a generic class of finite n-player games, as the mutation rate tends to zero,...

Saez-Marti and Weibull [4] investigate the consequences of letting some agents play a myopic best reply to the myopic best reply in Young's [8] bargaining model. This is how they introduce ''cleverness'' of players. We analyze such clever agents in general finite two-player games. We show that...

We here develop a model of pre-play communication that generalizes the cheap-talk approach by allowing players to have a lexicographic preference, second to the payoffs in the underlying game, for honesty. We formalize this by way of an honesty (or truth) correspondence between actions and...