Algorithmics Of Matching Under Preferences
David Manlove · 2013
Where to buy
Check today’s price on Amazon. We do not show prices because they change daily.
View on AmazonAffiliate link. As an Amazon Associate we earn from qualifying purchases.
About the book
Matching problems with preferences are all around us - they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists. In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide. This book describes the most important results in this area, providing a timely update to The Stable Marriage Problem: Structure and Algorithms (D Gusfield and R W Irving, MIT Press, 1989) in connection with stable matching problems, whilst also broadening the scope to include matching problems with preferences under a range of alternative optimality criteria.--
Book details
- Year
- 2013
- Language
- English
- Publisher
- World Scientific Publishing Company
- Editions
- 4
- Pages
- 491
- ISBN
- 9789814425247
Data source: Wikidata