酷居科技
内容提要:
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.
Readership: Students and Professionals interested in algorithms, especially in the study of algorithmic aspects of matching problems with preferences.
ISBN:9814425249
年份：2013
总页数：524
语言：English
文件大小：2.84 MB
文件格式：PDF
下载:关注本站公众号（右侧二维码），在 个性化-联系客服 中输入本文链接可获取文件下载链接。
