On the likely number of solutions for the stable marriage problem

  • Authors:

  • Craig Lennon;Boris Pittel

  • Affiliations:

  • Department of mathematics, the ohio state university, 231 w. 18th ave., columbus, oh 43210, usa (e-mail: lennon@math.ohio-state.edu, bgp@math.ohio-state.edu);Department of mathematics, the ohio state university, 231 w. 18th ave., columbus, oh 43210, usa (e-mail: lennon@math.ohio-state.edu, bgp@math.ohio-state.edu)

  • Venue:
  • Combinatorics, Probability and Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

An instance of a size-n stable marriage problem involves n men and n women, each individually ranking all members of opposite sex in order of preference as a potential marriage partner. A complete matching, a set of n marriages, is called stable if no unmatched man and woman prefer each other to their partners in the matching. It is known that, for every instance of marriage partner preferences, there exists at least one stable matching, and that there are instances with exponentially many stable matchings. Our focus is on a random instance chosen uniformly from among all (n!)2n possible instances. The second author had proved that the expected number of stable marriages is of order nlnn, while its likely value is of order n1/2−o(1) at least. In this paper the second moment of that number is shown to be of order (nlnn)2. The combination of the two moment estimates implies that the fraction of problem instances with roughly cnlnn solutions is at least 0.84. Whether this fraction is asymptotic to 1 remains an open question.