How hard is it to satisfy (almost) all roommates?
international colloquium on automata languages and programming, 2018.
The classic Stable Roommates problem (the non-bipartite generalization of the well-known Stable Marriage problem) asks whether there is a stable matching for a given set of agents, i.e. a partitioning of the agents into disjoint pairs such that no two agents induce a blocking pair. Herein, each agent has a preference list denoting who it ...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)