2018/04/16 by Andrei Ciupan, Ciupan, Andrei
Computer Science · #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #cs.DM
paper · pdf · doi:10.48550/arxiv.1804.05982
arxiv created 2018/04/18 · arxiv updated 2018/04/19
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.