Algorithmics of Matching Under PreferencesAlgorithmics of Matching Under Preferences
Title rated 0 out of 5 stars, based on 0 ratings(0 ratings)
eBook, 2013
Current format, eBook, 2013, , All copies in use.eBook, 2013
Current format, eBook, 2013, , All copies in use. Offered in 0 more formatsMatching 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.
Title availability
About
Contributors
- Writer of foreword
Subject and genre
Details
Publication
- Hackensack, New Jersey : World Scientific, [2013], ©2013
Opinion
More from the community
Community lists featuring this title
There are no community lists featuring this title
Community contributions
Community quotations are the opinions of contributing users. These quotations do not represent the opinions of Whistler Public Library.
There are no quotations from this title
Community quotations are the opinions of contributing users. These quotations do not represent the opinions of Whistler Public Library.
There are no quotations from this title
From the community