CHF 266.00

Algorithmics Of Matching Under Preferences

English · Hardback

Shipping usually within 3 to 5 weeks

Description

Read more










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

Authors David Manlove, David Manlove, Manlove David
Publisher World Scientific Publishing
 
Content Book
Product form Hardback
Publication date 25.04.2013
Subject Natural sciences, medicine, IT, technology > IT, data processing > Programming languages
 
EAN 9789814425247
ISBN 978-981-4425-24-7
Pages 524
Illustrations illustrations
 
Series Series On Theoretical Computer Science > 2
Subjects COMPUTERS / Programming / Algorithms
algorithms and data structures
Algorithms & data structures
 

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.