Free shipping on all orders in the USA!

Algorithmics of Matching Under Preferences (Series on Theoretical Computer Science)

ISBN: 9789814425247
Publisher: World Scientific Publishing Company
Edition: 1
Publication Date: 2013-03-20
Number of pages: 524
  • Sale
  • Regular price $180.45

Any used item that originally included an accessory such as an access code, one time use worksheet, cd or dvd, or other one time use accessories may not be guaranteed to be included or valid. By purchasing this item you acknowledge the above statement.

Description


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.

Readership: Students and Professionals interested in algorithms, especially in the study of algorithmic aspects of matching problems with preferences.


Customer Reviews


MORE FROM THIS COLLECTION