{
  "annotation_id": "8b7196d0-b2ab-4efb-96c8-f57fb4ba9910",
  "date_created": "2026-02-17T05:53:11.607000Z",
  "date_modified": "2026-02-17T05:53:11.607000Z",
  "file_hash": "279c88d757ad3da4a8c2b3fa3d85c36cd08afe5962092c30eede2e0fe10f305e",
  "private": false,
  "record": {
    "abstract": "Assume that $n = 2k$ potential roommates each have an ordered preference of the $n-1$ others. A stable matching is a perfect matching of the $n$ roommates in which no two unmatched people prefer each other to their matched partners. In their seminal 1962 stable marriage paper, Gale and Shapley noted that not every instance of the stable roommates problem admits a stable matching. In the case when the preferences are chosen uniformly at random, Gusfield and Irving predicted in 1989 that there is no stable matching with high probability for large $n$. We prove this conjecture and show that for $n$ sufficiently large, the probability there is a stable matching is at most $n^{-1/17}$.",
    "arxiv_id": "2601.07612",
    "authors": [
      "Byron Chin",
      "Marcus Michelen"
    ],
    "categories": [
      "math.CO",
      "math.PR"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "The random stable roommates problem typically has no solution",
    "url": "https://arxiv.org/abs/2601.07612",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2dc067b9-f35f-4c36-bbd1-2358d2e9076f",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}