A bargaining set for roommate problems

Since stable matchings may not exist, we propose a weaker notion of stability based on the credibility of blocking pairs. We adopt the weak stability notion of Klijn and Masso (2003) for the marriage problem and we extend it to the roommate problem. We first show that although stable matchings may not exist, a weakly stable matching always exists in a roommate problem. Then, we adopt a solution concept based on the credibility of the deviations for the roommate problem: the bargaining set. We show that weak stability is not sufficient for a matching to be in the bargaining set. We generalize the coincidence result for marriage problems of Klijn and Masso (2003) between the bargaining set and the set of weakly stable and weakly efficient matchings to roommate problems. Finally, we prove that the bargaining set for roommate problems is always non-empty by making use of the coincidence result. (c) 2020 The Author(s). Published by Elsevier B.V.