arXiv (OAI Expanded)
open access
Hospitals/Residents with Inseparable Couples: Finding a Coalition-Stable Assignment Is NP-Hard
In recent work on course allocation, Rodríguez and Manlove consider the complexity of finding a stable assignment under four notions of stability, including two coalitional notions. In one case, which they call pair-size stability, they show that a stable assignment always exists and they provide a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Hospitals/Residents with Inseparable Couples: Finding a Coalition-Stable Assignment Is NP-Hard#925209
- Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles#725168
- Efficient allocation with ordinal preference intensities#144160
- Fair Stable Matching: A Nash Social Welfare Approach#924243
- Fair Stable Matching: A Nash Social Welfare Approach#920012
Record · ID 920974
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive