Abstract
We analyze absorbing sets as a solution for roommate problems with strict preferences. This solution provides the set of stable matchings when it is non-empty and some matchings with interesting properties otherwise. In particular, all matchings in an absorbing set have the greatest number of agents with no incentive to change partners. These “satisfied” agents are paired in the same stable manner. In the case of multiple absorbing sets we find that any two such sets differ only in how satisfied agents are matched with each other.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
