Algorithmics of matching under preferences / David Manlove ; with a foreword by Kurt Mehlhorn.
Material type:
TextSeries: Series on theoretical computer science ; v 2.Publication details: Singapore ; World Scientific, c2013.Description: xxxi, 491 p. ; 24 cmISBN: - 9789814425247 (hbk.)
- 511.66 23 M279
| Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|
| Books | ISI Library, Kolkata | 511.66 M279 (Browse shelf(Opens below)) | Available | 136104 |
Includes bibliographical references (p. 417-460) and index.
1. Preliminary Definitions, Results and Motivation;
Stable Matching Problems:
2. The Stable Marriage Problem: An Update;
3. SM and HR with Indifference;
4. The Stable Roommates Problem;
5. Further Stable Matching Problems;
Other Optimal Matching Problems:
6. Pareto Optimal Matchings;
7. Popular Matchings;
8. Profile-Based Optimal Matchings;
Bibliography;
Glossary of symbols;
Index.
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.
There are no comments on this title.
