Pages that link to "Item:Q1733384"
From MaRDI portal
The following pages link to The stable roommates problem with short lists (Q1733384):
Displaying 9 items.
- ``Almost stable'' matchings in the roommates problem with bounded preference lists (Q428844) (← links)
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- The Stable Roommates Problem with Short Lists (Q2819460) (← links)
- The Stable Roommates Problem with Ties (Q3150272) (← links)
- How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
- A General Framework for Stable Roommates Problems using Answer Set Programming (Q5140025) (← links)
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306) (← links)
- A note on roommate problems with a limited number of rooms (Q6156319) (← links)
- Egalitarian roommate allocations: complexity and stability (Q6658303) (← links)