Algorithmics of Matching Under Preferences

David Manlove

ISBN 10: 9814425249 / ISBN 13: 9789814425247

Published by World Scientific Publishing Co Pte Ltd, 2013

About this Item

2013. 1st Edition. Hardcover. 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. Series: Series on Theoretical Computer Science. Num Pages: 524 pages, illustrations. BIC Classification: UMB. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 162 x 235 x 32. Weight in Grams: 864. . . . . .

Seller Inventory # V9789814425247

Bibliographic Details

• Title: Algorithmics of Matching Under Preferences
• Publisher: World Scientific Publishing Co Pte Ltd
• Publication Date: 2013
• Language: English
• ISBN 10: 9814425249
• ISBN 13: 9789814425247
• Binding: Hardcover
• Edition: 1st Edition
• Condition: New

About this title

Synopsis

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. 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.

From the Back Cover

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.