Stable Roommates Problem
The Stable Roommates Problem is a combinatorial optimization problem in matching theory that involves partitioning an even number of agents into pairs such that no two agents mutually prefer each other over their assigned partners, distinguished from other matching problems by the absence of a bipartite structure.
56
Publications
2.7K
Citations
88
Authors
65
Institutions
Publications per year
2017–2026
9
Parents
56
On the Existence of Stable Roommate Matchings
Kim‐Sau Chung · Games and Economic Behavior · 2000 · 176 citations
The Stable Roommates Problem with Ties
Robert W. Irving, David F. Manlove · Journal of Algorithms · 2002 · 123 citations
1–5 of 56
88
7
h-index
7
h-index
4
h-index
4
h-index
3
h-index
1–5 of 88
65

University of Glasgow
Glasgow, United Kingdom
9 h-index
15 publications
758 citations

University of the Basque Country
Leioa, Spain
4 h-index
8 publications
180 citations
Technische Universität Berlin
Berlin, Germany
4 h-index
8 publications
125 citations
Institute of Economics
Budapest, Hungary
4 h-index
4 publications
96 citations

Hungarian Academy of Sciences
Budapest, Hungary
4 h-index
4 publications
96 citations

Budapest University of Technology and Economics
Budapest, Hungary
3 h-index
4 publications
169 citations
University of Pavol Jozef Šafárik
Košice, Slovakia
3 h-index
3 publications
133 citations

The University of Sydney
Sydney, Australia
3 h-index
3 publications
287 citations
1–8 of 65
3 publications · 104 citations
3
h-index
3 publications · 311 citations
3
h-index
2 publications · 138 citations
2
h-index
2 publications · 555 citations
2
h-index
JET · 2 publications · 100 citations
2
h-index
1–5