arXiv (All)
open access
Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings
In the Stable Roommates Problem (SR), a set of $2n$ agents rank one another in a linear order. The goal is to find a matching that is stable: one that has no pair of agents who mutually prefer each other over their assigned partners. We consider the problem of finding an optimal stable matching. Age
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
- Fair Stable Matching: A Nash Social Welfare Approach#924243
- Fair Stable Matching: A Nash Social Welfare Approach#920012
- Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem#924397
- Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem#920166
- Control and Bribery in Stable Marriage and Stable Roommates: A Complete Complexity Landscape#1036538
Record · ID 820398
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