--- Book announcement ---
Title: Algorithmics of Matching Under Preferences
Author: David F Manlove (University of Glasgow, UK)
Series: Series on Theoretical Computer Science: Volume 2
Publisher: World Scientific
Date: April 2013
ISBN: 978-981-4425-24-7
URL: http://www.worldscientific.com/worldscibooks/10.1142/8591
--- About the book ---
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.
--- Sample material ---
Table of Contents:
http://www.worldscientific.com/doi/pdf/10.1142/9789814425254_fmatter
Foreword (by Kurt Mehlhorn):
http://www.worldscientific.com/doi/suppl/10.1142/8591/suppl_file/8591_foreword.pdf
Chapter 1 (Preliminary definitions, results and motivation):
http://www.worldscientific.com/doi/suppl/10.1142/8591/suppl_file/8591_chap01.pdf
--- Availability ---
Available in hardcover, e-book and kindle editions from on-line
booksellers such as Amazon.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************