Algorithmics of Matching Under Preferences

Algorithmics of Matching Under Preferences

eBook - 2013
Rate this:
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.
Publisher: Hackensack, New Jersey :, World Scientific,, [2013]
Copyright Date: ©2013
ISBN: 9789814425254
9814425257
9789814425247
9814425249
Characteristics: 1 online resource (xxxi, 415 pages)
Additional Contributors: Mehlhorn, Kurt 1949-

Opinion

From the critics


Community Activity

Comment

Add a Comment

There are no comments for this title yet.

Age Suitability

Add Age Suitability

There are no age suitabilities for this title yet.

Summary

Add a Summary

There are no summaries for this title yet.

Notices

Add Notices

There are no notices for this title yet.

Quotes

Add a Quote

There are no quotes for this title yet.

Explore Further

Recommendations

Subject Headings

  Loading...

Find it at SPL

  Loading...
[]
[]
To Top