Preference Cycles in Stable Matchings
Discrete Mathematics
2018-04-19 v2
Abstract
Consider the stable matching problem on two sets. We introduce the concept of a preference cycle and show how its natural presence in stable matchings proves a series of classical results in an elementary way.
Keywords
Cite
@article{arxiv.1804.05982,
title = {Preference Cycles in Stable Matchings},
author = {Andrei Ciupan},
journal= {arXiv preprint arXiv:1804.05982},
year = {2018}
}