Gusfield and Irving [1]} considered the extension of the stable roommates problem where the agents' preference lists do not need to be complete (SRI). They showed that the earlier algorithm by Irving [2]} extends naturally to this case. They also proved the important result that for any instance of SRI, the set of agents which are matched is the same across all the possible stable matchings [1]}.
