Algorithmics of Matching Under Preferences: Series on Theoretical Computer Science, cartea 2

Autor David Manlove
en Limba Engleză Hardback – 20 mar 2013
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. This book deals with this topic.
Citește tot Restrânge

Preț: 99030 lei

Preț vechi: 123788 lei

Puncte Express: 1485

Preț estimativ în valută:
18951 20298$ 16025£

Carte tipărită la comandă

Livrare economică 30 iulie-13 august
Livrare express 25-29 iunie pentru 13252 lei

Preluare comenzi: 021 569.72.76


ISBN-13: 9789814425247
ISBN-10: 9814425249
Pagini: 524
Ilustrații: illustrations
Dimensiuni: 155 x 231 x 33 mm
Greutate: 0.86 kg
Editura: World Scientific Publishing Company
Seria Series on Theoretical Computer Science


Preliminary Definitions, Results and Motivation; Stable Matching Problems: The Stable Marriage Problem: An Update; SM and HR with Indifference; The Stable Roommates Problem; Further Stable Matching Problems; Other Optimal Matching Problems: Pareto Optimal Matchings; Popular Matchings; Profile-Based Optimal Matchings.

Notă biografică

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.