Algorithmics of matching under preferences:

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 prefer...

Full description

Saved in:
Bibliographic Details
Main Author: Manlove, David F. (Author)
Format: Electronic eBook
Language:English
Published: Singapore World Scientific Pub. Co. c2013
Series:Series on theoretical computer science v. 2
Subjects:
Online Access:FHN01
Volltext
Summary: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
Physical Description:xxxi, 491 p. ill
ISBN:9789814425254

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Get full text