A Linear Programming Approach to the Super-Stable Roommates Problem
Abstract
The stable roommates problem is a non-bipartite version of the well-known stable matching problem. Teo and Sethuraman proved that, for each instance of the stable roommates problem in a complete graph, there exists a linear inequality system such that there exists a feasible solution to this system if and only if there exists a stable matching in the given instance. The aim of this paper is to extend the result of Teo and Sethuraman to the stable roommates problem with ties. More concretely, we prove that, for each instance of the stable roommates problem with ties in a complete graph, there exists a linear inequality system such that there exists a feasible solution to this system if and only if there exists a super-stable matching in the given instance.
Keywords
Cite
@article{arxiv.2503.16052,
title = {A Linear Programming Approach to the Super-Stable Roommates Problem},
author = {Naoyuki Kamiyama},
journal= {arXiv preprint arXiv:2503.16052},
year = {2025}
}
Comments
small mistakes are fixed