Preference Cycles in Stable Matchings

04/16/2018

∙

by   Andrei Ciupan, et al.

∙

0

∙

share

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.