The ``stable roommates problem with random preferences

DOI10.1214/aop/1176989126zbMath0778.60005OpenAlexW1990302986MaRDI QIDQ688057

Boris G. Pittel

Publication date: 5 January 1994

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1176989126

zbMATH Keywords

ranksorderconditional probabilitystable matchingasymptotic meanrandom preferences

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Permutations, words, matrices (05A05) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Multidimensional problems (41A63) Limit theorems in probability theory (60F99)

Related Items (13)

On random exchange-stable matchings ⋮ Review of the theory of stable matchings and contract systems ⋮ The core of roommate problems: size and rank-fairness within matched pairs ⋮ Coalitional stability in matching problems with externalities and random preferences ⋮ One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective ⋮ Stable roommates problem with random preferences ⋮ Small random instances of the stable roommates problem ⋮ On the Likely Number of Solutions for the Stable Marriage Problem ⋮ Coalescence on the real line ⋮ Matching with externalities: the role of prudence and social connectedness in stability ⋮ On random stable partitions ⋮ Random stable matchings

This page was built for publication: The ``stable roommates problem with random preferences