Algorithmics Of Matching Under Preferences
Regular price
€204.60
14 days return policy
Shipping & Delivery
A01=David Manlove
Algorithms
Author_David Manlove
Category=UMB
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Hospitals Residents Problem
House Allocation Problem
Matching Problems
Preferences
Stable Marriage Problem
Stable Roomates Problem
Product details
- ISBN 9789814425247
- Publication Date: 25 Apr 2013
- Publisher: World Scientific Publishing Co Pte Ltd
- Publication City/Country: SG
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
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.
