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

Authors

88

  1. RW
    Robert W. Irving

    University of Glasgow, United Kingdom

    7 publications · 760 citations

    7

    h-index

  2. DF
    David F. Manlove

    University of Glasgow, United Kingdom

    7 publications · 327 citations

    7

    h-index

  3. EI
    Elena Iñarra

    University of the Basque Country, Spain

    4 publications · 84 citations

    4

    h-index

  4. PB
    Péter Bíró

    Hungarian Academy of Sciences, Hungary

    4 publications · 103 citations

    4

    h-index

  5. KC
    Katarı́na Cechlárová

    University of Pavol Jozef Šafárik, Slovakia

    3 publications · 133 citations

    3

    h-index

1–5 of 88

Venues

  1. Theoretical Computer Science

    3 publications · 104 citations

    3

    h-index

  2. Games and Economic Behavior

    3 publications · 311 citations

    3

    h-index

  3. SIAM Journal on Computing

    2 publications · 138 citations

    2

    h-index

  4. Journal of Algorithms

    2 publications · 555 citations

    2

    h-index

  5. Journal of Economic Theory

    JET · 2 publications · 100 citations

    2

    h-index

1–5