UOWD Library

Normal view MARC view ISBD view

Algorithmics of matching under preferences /

By: Manlove, David
Material type: BookPublisher: Singapore ; Hackensack, NJ : World Scientific Pub. Co., c2013.Description: xxxi, 491 p. ; 24 cm.ISBN: 9789814425247 (hbk.); 9814425249 (hbk.)Subject(s): Matching theoryDDC classification: 511.66 Online resources: Location Map
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Home library Call number Status Date due Barcode Item holds
REGULAR University of Wollongong in Dubai
Main Collection 		511.66 MA AL (Browse shelf) Available T0049503
Total holds: 0

Includes bibliographical references (p. 417-460) and index.

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.

Powered by Koha