An upper bound for the solvability probability of a random stable roommates instance
From MaRDI portal
Publication:4306375
DOI10.1002/rsa.3240050307zbMath0805.60010MaRDI 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 analysis; computer simulations; stable matching; random preferences; preference orderings; stable pairing
60C05: Combinatorial probability
Related Items
``Almost stable matchings in the roommates problem with bounded preference lists, The integral stable allocation problem on graphs, Absorbing sets in roommate problems, The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems, A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings, On the Likely Number of Solutions for the Stable Marriage Problem
Cites Work