Kindle Price: £63.60

Save £34.40 (35%)

includes VAT*
* Unlike print books, digital books are subject to VAT.

These promotions will be applied to this item:

Some promotions may be combined; others are not eligible to be combined with other offers. For details, please see the Terms & Conditions associated with these promotions.

Deliver to your Kindle or other device

Deliver to your Kindle or other device

Kindle App Ad
Algorithmics of Matching Under Preferences: 2 (Series on Theoretical Computer Science) by [Manlove, David F]

Algorithmics of Matching Under Preferences: 2 (Series on Theoretical Computer Science) Kindle Edition

5.0 out of 5 stars 1 customer review

See all 3 formats and editions Hide other formats and editions
Amazon Price
New from Used from
Kindle Edition
£63.60

Kindle Monthly Deal
Browse a new selection of discounted Kindle Books each month. Shop now

Product description

Review

Besides being extremely useful to those who are interested in design and analysis techniques related to algorithms and complexity issues related to the matching of agents to one another when preferences are involved, involved readers can also benefit from the easy way it presents various ideas and approaches to problem solutions. It is written in a highly scientific language and it is extraordinarily beneficial reading for post-docs and researchers in mathematics and in game theory that focus on algorithms for solving matching problems and also study applications involving such problems. --Zentralblatt MATH

The author describes the structural ideas behind the algorithms, avoiding technical proofs. This guided tour is so interesting that the novice will want to explore things on his own, is invited to do so by the open questions at the end of each section. The long time it took to write this book was well spent. It deserves the attention of every reader interested in the field. --Mathematical Reviews Clippings

From the Inside Flap

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.


Product details

  • Format: Kindle Edition
  • File Size: 9228 KB
  • Print Length: 524 pages
  • Publisher: WSPC (20 Mar. 2013)
  • Sold by: Amazon Media EU S.à r.l.
  • Language: English
  • ASIN: B00CFG09DA
  • Text-to-Speech: Enabled
  • X-Ray:
  • Word Wise: Not Enabled
  • Enhanced Typesetting: Enabled
  • Average Customer Review: 5.0 out of 5 stars 1 customer review
  • Would you like to tell us about a lower price?


Customer reviews

Share your thoughts with other customers
See all 1 customer reviews

Top customer reviews

11 October 2013
Format: Hardcover|Verified Purchase

Most helpful customer reviews on Amazon.com

Amazon.com: 5.0 out of 5 stars 1 reviews
cat
5.0 out of 5 starsA gem of scholarship!
31 July 2014 - Published on Amazon.com
Format: Hardcover
2 people found this helpful.
click to open popover

Where's My Stuff?

Delivery and Returns

Need Help?