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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!