Reproduce “The Strongly Stable Roommates Problem and Linear Programming” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Naoyuki Kamiyama
The paper presents a linear-programming algorithm for deciding whether a strongly stable matching exists in a roommates problem with tied preferences. It models pairs as a graph and repeatedly restricts linear programs using matching constraints, including odd-set inequalities. The authors prove the method either finds such a matching or reports none in polynomial time with at most O(|E|) iterations.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.