ALGORITHMICS OF MATCHING UNDER PREFERENC: 2 (Series On Theoretical Computer Science) - Tapa dura

DAVID MANLOVE

 
9789814425247: ALGORITHMICS OF MATCHING UNDER PREFERENC: 2 (Series On Theoretical Computer Science)
Tapa dura
ISBN 10: 9814425249 ISBN 13: 9789814425247
Editorial: World Scientific, 2013

Sinopsis

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. The importance of the research area was recognised in 2012 through the award of the Nobel Prize in Economic Sciences to Alvin Roth and Lloyd Shapley.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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

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.

De la contraportada

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. The importance of the research area was recognised in 2012 through the award of the Nobel Prize in Economic Sciences to Alvin Roth and Lloyd Shapley.

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
World Scientific
Año de publicación
2013
Idioma
Inglés
ISBN 10 
9814425249
ISBN 13 
9789814425247
Encuadernación
Tapa dura
Número de páginas
524
Contacto del fabricante
no disponible
Persona responsable
no disponible