Algorithmics Of Matching Under Preferences

· Series On Theoretical Computer Science Libro 2 · World Scientific
Libro electrónico
524
Páxinas
Apto
As valoracións e as recensións non están verificadas  Máis información

Acerca deste libro electrónico

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.

Valora este libro electrónico

Dános a túa opinión.

Información de lectura

Smartphones e tabletas
Instala a aplicación Google Play Libros para Android e iPad/iPhone. Sincronízase automaticamente coa túa conta e permíteche ler contido en liña ou sen conexión desde calquera lugar.
Portátiles e ordenadores de escritorio
Podes escoitar os audiolibros comprados en Google Play a través do navegador web do ordenador.
Lectores de libros electrónicos e outros dispositivos
Para ler contido en dispositivos de tinta electrónica, como os lectores de libros electrónicos Kobo, é necesario descargar un ficheiro e transferilo ao dispositivo. Sigue as instrucións detalladas do Centro de Axuda para transferir ficheiros a lectores electrónicos admitidos.