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