An upper bound for the solvability probability of a random stable roommates instance
From MaRDI portal
Publication:4306375
DOI10.1002/rsa.3240050307zbMath0805.60010OpenAlexW2086852721MaRDI QIDQ4306375
Robert W. Irving, Boris G. Pittel
Publication date: 29 January 1995
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240050307
probabilistic analysiscomputer simulationsstable matchingrandom preferencespreference orderingsstable pairing
Related Items (14)
A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings ⋮ On random exchange-stable matchings ⋮ Stability against robust deviations in the roommate problem ⋮ ``Almost stable matchings in the roommates problem with bounded preference lists ⋮ Absorbing sets in roommate problems ⋮ The integral stable allocation problem on graphs ⋮ One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences ⋮ Stable roommates problem with random preferences ⋮ On the Likely Number of Solutions for the Stable Marriage Problem ⋮ On random stable partitions ⋮ The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems ⋮ A bargaining set for roommate problems ⋮ Super-stability in the student-project allocation problem with ties ⋮ Random stable matchings
Cites Work
This page was built for publication: An upper bound for the solvability probability of a random stable roommates instance
