Algorithmics of matching under preferences

Algorithmics of matching under preferences

by Manlove, David F.

Type Book
Rate 0.0 /5

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 pro…

Read More ↓

Title Statements

  • Full title :Algorithmics of matching under preferences / David F. Manlove ; with a foreword by Kurt Mehlhorn.

Summary

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 upda.

Read More ↓

Edition Statements

  • Publication Date:c2013.

Publication Statements

  • Publisher(s):World Scientific
  • Place of Publication:[Hackensack] N.J
  • Language:eng
  • Publication Date:c2013.

Notes

Description based upon print version of record.

2.8 Size versus stability

The Physical Object

  • Description:1 online resource (524 p.).

Edition Identifiers

  • ISBN:1299462510, 9781299462519, 9814425257, 9789814425254
  • oclc:on1162523016
  • LC Classification:QA76.9.A43
  • Dewey Decimal:005.1

Table of Contents

Preface; Foreword; Acknowledgments; Contents; List of Figures; List of Tables; List of Algorithms; 1. Preliminary definitions, results and motivation; 1.1 Introduction; 1.1.1 Remit of this book; 1.1.1.1 Matching under preferences; 1.1.1.2 Free-for-all markets; 1.1.1.3 Centralised matching schemes; 1.1.2 The matching problems under consideration; 1.1.2.1 Classification of matching problems; 1.1.2.2 Bipartite matching problems with two-sided preferences; 1.1.2.3 Bipartite matching problems with one-sided preferences; 1.1.2.4 Non-bipartite matching problems with preferences

1.1.2.5 Further problem variants1.1.3 Existing literature on matching problems; 1.1.3.1 Algorithms and complexity literature; 1.1.3.2 Game theory and economics literature; 1.1.3.3 Algorithmic mechanism design literature; 1.1.4 Contribution of this book; 1.1.4.1 General overview; 1.1.4.2 Chapter outline; 1.1.4.3 What the book does not contribute; 1.1.5 Outline of this chapter; 1.2 Matchings in graphs; 1.3 The Hospitals / Residents problem (hr); 1.3.1 Introduction; 1.3.2 Key definitions; 1.3.3 Key results (up to 1989); 1.3.4 Stable Marriage problem (sm); 1.3.4.1 Key definitions

1.3.4.2 Key results (up to 1989)1.3.…

Read More ↓

Subjects

Writers

More from this Series

  • Algorithmics of matching under preferences

    ©2013.
    more →
    Algorithmics of matching under preferences
  • Algorithmics of matching under preferences

    ©2013.
    more →
    Algorithmics of matching under preferences
  • Algorithmics of matching under preferences

    ©2013
    more →
    Algorithmics of matching under preferences
  • Algorithmics of matching under preferences

    ©2013.
    more →
    Algorithmics of matching under preferences
  • Algorithmics of matching under preferences

    ©2013
    more →
    Algorithmics of matching under preferences

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

  • Algorithmics of Matching Under Preferences -- (.p…

    PDF · 2.5 MB · updated