| 000 | 01689nam a22002297a 4500 | ||
|---|---|---|---|
| 999 |
_c22117 _d22117 |
||
| 001 | 55150 | ||
| 010 | _a 2012554957 | ||
| 020 | _a9789814425247 (hbk.) | ||
| 020 | _a9814425249 (hbk.) | ||
| 040 | _aUKMGB | ||
| 082 | 0 | 4 | _a511.66 |
| 100 | 1 |
_aManlove, David. _958469 |
|
| 245 | 1 | 0 |
_aAlgorithmics of matching under preferences / _cDavid Manlove ; with a foreword by Kurt Mehlhorn. |
| 260 |
_aSingapore ; _aHackensack, NJ : _bWorld Scientific Pub. Co., _cc2013. |
||
| 300 |
_axxxi, 491 p. ; _c24 cm. |
||
| 504 | _aIncludes bibliographical references (p. 417-460) and index. | ||
| 520 | _aMatching 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. | ||
| 650 | 0 |
_aMatching theory. _958470 |
|
| 830 | 0 |
_aSeries on theoretical computer science ; Vol. 2. _958471 |
|
| 856 |
_uhttps://uowd.box.com/s/676cxmyhn50ppf6rd7cpopet9e2v79b1 _zLocation Map |
||
| 942 |
_cREGULAR _2ddc |
||