A one-shot deviation principle for stability in matching problems
Access status:
Open Access
Type
Working PaperAbstract
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.
See less
See less
Date
2013-06-01Publisher
School of EconomicsDepartment, Discipline or Centre
School of EconomicsShare