arXiv (All)
open access
Perspectives on Unsolvability in the Roommates Problem
Instances of the well-studied Stable Roommates problem need not admit stable matchings. A long-standing open question posed by Gusfield and Irving (1989) asks about the behaviour of the function Pn, which measures the likelihood that a random instance with n agents is solvable (i.e., admits at least
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
- Universally trusted bridges for heterogenous blockchain networks — Paypal, Inc. (US11888991B2)#607097
- A problem not peculiar to counterfactual sufficiency#173733
- Modal Luck and Buried Treasure#228675
- Resilient Liquid Democracy: Mitigating Voting Power Imbalances via Secure Delegation Networks#332463
- On detection probabilities of link invariants#629824
Record · ID 1156183
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