Abstract
February 28. Given a set of men and a set of women, a matching is a set of pairs, each pair containing one man and one woman, such that no person is in more than one pair. We shall be interested in finding matchings satisfying various criteria. The first problem we’ll consider is called the stable marriage problem. We assume that there are the same number of men as women, and that each person ranks the people of the opposite sex in order of preference.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2010 Birkhäuser Boston
About this chapter
Cite this chapter
Pólya, G., Tarjan, R.E., Woods, D.R. (2010). Matchings (Stable Marriages). In: Notes on Introductory Combinatorics. Modern Birkhäuser Classics. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4953-1_10
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4953-1_10
Published:
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4954-8
Online ISBN: 978-0-8176-4953-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)