Efficient Algorithms For Optimal Matching Problems Under Preferences
Download and Read Efficient Algorithms For Optimal Matching Problems Under Preferences full books in PDF, ePUB, and Kindle. Read online free Efficient Algorithms For Optimal Matching Problems Under Preferences ebook anywhere anytime directly on your device. We cannot guarantee that every ebooks is available!
Algorithmics of Matching Under Preferences
Author | : David F. Manlove |
Publisher | : World Scientific |
Total Pages | : 524 |
Release | : 2013 |
Genre | : Mathematics |
ISBN | : 9814425257 |
Download Algorithmics of Matching Under Preferences Book in PDF, Epub and Kindle
Matching problems with preferences are all around us OCo 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."
Algorithmics of Matching Under Preferences Related Books
Pages: 524
Pages: 175
Pages: 149
Pages: 0
Pages: 0