Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-26T04:04:54.563Z Has data issue: false hasContentIssue false
  • English
  • Français

Random permutations and stable matchings

Published online by Cambridge University Press:  01 July 2016

B. G. Pittel
B. G. Pittel*
Affiliation:
Ohio State University
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Invited Papers
Information
Advances in Applied Probability , Volume 24 , Issue 4 , December 1992 , pp. 769 - 770
Copyright
Copyright © Applied Probability Trust 1992 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Irving, R. W. (1985) An efficient algorithm for the stable roommates problem. J. Algorithms 6, 577–595.Google Scholar
Pittel, B. (1989) The average number of stable matchings. SIAM J. Discrete Math. 2, 530–549.Google Scholar
Pittel, B. (1992a) On likely solutions of a stable marriage problem. Ann. Appl. Prob. 2, 358–406.Google Scholar
Pittel, B. (1992b) The ‘stable roommates’ problem with random preferences. Ann. Prob. To appear.CrossRefGoogle Scholar
Pittel, B. (1992c) On a random instance of a ‘stable roommates’ problem. Likely behaviour of the proposal algorithm. Submitted.Google Scholar
Shapley, L. S. and Scarf, H. (1974) On cores and indivisibility. J. Math. Econ. 1, 23–28.CrossRefGoogle Scholar
Tan, J. J. M. (1991) A necessary and sufficient condition for the existence of a complete stable matching. J. Algorithms 12, 154–178.Google Scholar