On the Number of Fixed Pairs in a Random Instance of the Stable Marriage Problem

DOI10.1137/070696155zbMATH Open1151.05002OpenAlexW1984129754MaRDI QIDQ3544244FDOQ3544244

Authors: Larry Shepp, Eugene Veklerov, Boris 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

Recommendations

• The Average Number of Stable Matchings
• On the likely number of solutions for the stable marriage problem
• The ``stable roommates problem with random preferences
• On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women
• On likely solutions of a stable marriage problem

zbMATH Keywords

asymptoticsstable matchinglikely behaviorproposal algorithmrandom instance

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Cited In (7)

• Optimal truncation in matching markets
• On the likely number of solutions for the stable marriage problem
• Deferred acceptance is minimally manipulable
• Two-sided matching markets with strongly correlated preferences
• The graphs of stably matchable pairs
• On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women
• On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences

This page was built for publication: On the Number of Fixed Pairs in a Random Instance of the Stable Marriage Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3544244)