Pages that link to "Item:Q2205948"
From MaRDI portal
The following pages link to Solving hard stable matching problems involving groups of similar agents (Q2205948):
Displaying 3 items.
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters (Q2105427) (← links)
- Recognizing when a preference system is close to admitting a master list (Q6124592) (← links)
- Stable matching with multilayer approval preferences: approvals can be harder than strict preferences (Q6188265) (← links)
