Algorithmics of Matching Under Preferences: 2 - Rilegato

Manlove, David F.

 
9789814425247: Algorithmics of Matching Under Preferences: 2

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Informazioni sull?autore

Dr David Manlove is a Senior Lecturer in Computing Science at the University of Glasgow. His research interests lie in the area of algorithms and complexity, with a specific focus on matching problems involving preferences. With respect to this topic he has coauthored over 40 papers and has co-edited a special issue of Algorithmica.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.