Algorithmics of Matching Under Preferences

Algorithmics of Matching Under Preferences
Author :
Publisher : World Scientific
Total Pages : 524
Release :
ISBN-10 : 9789814425254
ISBN-13 : 9814425257
Rating : 4/5 (54 Downloads)

Book Synopsis Algorithmics of Matching Under Preferences by : David F. Manlove

Download or read book Algorithmics of Matching Under Preferences written by David F. Manlove and published by World Scientific. This book was released on 2013 with total page 524 pages. Available in PDF, EPUB and Kindle. Book excerpt: Matching problems with preferences are all around us OCo 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."


Algorithmics of Matching Under Preferences Related Books

Algorithmics of Matching Under Preferences
Language: en
Pages: 524
Authors: David F. Manlove
Categories: Mathematics
Type: BOOK - Published: 2013 - Publisher: World Scientific

DOWNLOAD EBOOK

Matching problems with preferences are all around us OCo they arise when agents seek to be allocated to one another on the basis of ranked preferences over pote
Algorithmics Of Matching Under Preferences
Language: en
Pages: 524
Authors: David Manlove
Categories: Computers
Type: BOOK - Published: 2013-03-20 - Publisher: World Scientific

DOWNLOAD EBOOK

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 potenti
WALCOM: Algorithms and Computation
Language: en
Pages: 398
Authors: Chun-Cheng Lin
Categories: Computers
Type: BOOK - Published: 2023-03-13 - Publisher: Springer Nature

DOWNLOAD EBOOK

This book constitutes the proceedings of the 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, which took place in Hsinchu
Algorithmic Game Theory
Language: en
Pages: 401
Authors: Dimitris Fotakis
Categories: Computers
Type: BOOK - Published: 2019-09-16 - Publisher: Springer Nature

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 12th International Symposium on Algorithmic Game Theory, SAGT 2019, held in Athens, Greece, in September/O
Two-Sided Matching
Language: en
Pages: 288
Authors: Alvin E. Roth
Categories: Business & Economics
Type: BOOK - Published: 1992-06-26 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

Two-sided matching provides a model of search processes such as those between firms and workers in labor markets or between buyers and sellers in auctions. This