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.
['Jonathan Newton', 'Ryoji Sawa']
A one-shot deviation principle for stability in matching problems