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.

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.

We consider deterministic evolutionary dynamics under imitative revision protocols. We allow agents to have different aspiration levels in the imitative protocols where their aspiration levels are not observable to other agents. We show that the distribution of strategies becomes statistically...

This paper examines a dynamic process of n-person coalitional bargaining problems. We study the stochastic evolution of social conventions by embedding a static bargaining setting in a dynamic process; Over time agents revise their coalitions and surplus distributions in the presence of...

This paper examines a dynamic process of unilateral and joint deviations of agents and the resulting stochastic evolution of social conventions. Our model unifies stochastic stability analysis in static settings, including normal form games, network formation games, and simple exchange...