Small random instances of the stable roommates problem
From MaRDI portal
Abstract: Let denote the probability that a random instance of the stable roommates problem of size admits a solution. We derive an explicit formula for and compute exact values of for .
Recommendations
Cites work
- A necessary and sufficient condition for the existence of a complete stable matching
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- Beauty and distance in the stable marriage problem
- College Admissions and the Stability of Marriage
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm
- Random stable matchings
- Stable roommates problem with random preferences
- The ``stable roommates problem with random preferences
- The On-Line Encyclopedia of Integer Sequences
Cited in
(5)- The Stable Roommates Problem with Short Lists
- Stable roommates problem with random preferences
- On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm
- An upper bound for the solvability probability of a random stable roommates instance
- A note on roommate problems with a limited number of rooms
This page was built for publication: Small random instances of the stable roommates problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3302312)