.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Algorithmics of Matching Under Preferences
David Manlove
€ 198.92
FREE Delivery in Ireland
Description for Algorithmics of Matching Under Preferences
Hardback. 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. This book deals with this topic. Series: Series on Theoretical Computer Science. Num Pages: 524 pages, illustrations. BIC Classification: UMB. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 162 x 235 x 32. Weight in Grams: 864.
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 ... 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 ... Read more
Product Details
Publisher
World Scientific Publishing Co Pte Ltd Singapore
Number of pages
524
Format
Hardback
Publication date
2013
Series
Series on Theoretical Computer Science
Condition
New
Weight
864g
Number of Pages
524
Place of Publication
Singapore, Singapore
ISBN
9789814425247
SKU
V9789814425247
Shipping Time
Usually ships in 4 to 8 working days
Ref
99-5
About David Manlove
Dr David Manlove is a Senior Lecturer in Computing Science at the University of Glasgow. His research interests lie in the area of algorithms and complexity, with a specific focus on matching problems involving preferences. With respect to this topic he has coauthored over 40 papers and has co-edited a special issue of Algorithmica.
Reviews for Algorithmics of Matching Under Preferences