On the Number of Fixed Pairs in a Random Instance of the Stable Marriage Problem
From MaRDI portal
Publication:3544244
DOI10.1137/070696155zbMath1151.05002OpenAlexW1984129754MaRDI QIDQ3544244
Eugene Veklerov, Lawrence A. Shepp, Boris G. Pittel
Publication date: 5 December 2008
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070696155
Permutations, words, matrices (05A05) Combinatorial probability (60C05) Asymptotic enumeration (05A16)
Related Items (6)
Two-sided matching markets with strongly correlated preferences ⋮ The graphs of stably matchable pairs ⋮ On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences ⋮ Optimal truncation in matching markets ⋮ Deferred acceptance is minimally manipulable ⋮ On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women
This page was built for publication: On the Number of Fixed Pairs in a Random Instance of the Stable Marriage Problem