In a k-double auction, a buyer and a seller must simultaneously announce a bid and an ask price respectively. Exchange of the indivisible good takes place if and only if the bid is at least as high as the ask, the trading price being the bid price with probability k and the ask price with...

This paper studies stochastic stability methods applied to processes on general state spaces. This includes settings in which agents repeatedly interact and choose from an uncountable set of strategies. Dynamics exist for which the stochastically stable states differ from those of any reasonable...

This study considers pure coordination games on networks and the waiting time for an adaptive process of strategic change to achieve efficient coordination. Although it is in the interest of every player to coordinate on a single globally efficient norm, coalitional behavior at a local level can...

This paper considers marriage problems, roommate problems with nonempty core, and college admissions problems with responsive preferences. All stochastically stable matchings are shown to be contained in the set of matchings which are most robust to one-shot deviation.

In a dynamic model of assignment problems, small deviations suffice to move between stable outcomes. This result is used to obtain no-selection and almost-no-selection results under the stochastic stability concept for uniform and payoff-dependent errors. There is no-selection of partner or...