ALGORITHMICS OF MATCHING UNDER PREFERENCES(SERIES ON THEORETICAL COMPUTER SCIENCE)

偏好匹配算法

计算机软件

原   价:
1928.75
售   价:
1543.00
优惠
平台大促 低至8折优惠
发货周期:预计3-5周发货
作      者
出  版 社
出版时间
2013年03月20日
装      帧
精装
ISBN
9789814425247
复制
页      码
524
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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. Key Features: • Provides a much-needed “sequel” to Gusfield and Irving, given that so many papers on matching problems with preferences have been published since 1989 • Collects together a survey of the main results from these publications in a single volume • Contains unique single survey on efficient algorithms for constructing optimal matchings where the optimality criterion does not involve stability
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个