Algorithmics of matching under preferences

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

Full description

Saved in:
Bibliographic Details
Main Author: Manlove, David
Format: eBook Book
Language:English
Published: Singapore World Scientific Publishing Co. Pte. Ltd 2013
World Scientific Publishing Company
WORLD SCIENTIFIC
WSPC
Edition:1
Series:Series on theoretical computer science
Subjects:
Computer algorithms
Econometrics
Formal Specification (Software Engineering, Mathematical Logic)
Game Theory
Matching theory
Mathematical Economics
House Allocation Problem
Algorithms
Stable Marriage Problem
Stable Roomates Problem
Hospitals / Residents Problem
Preferences
Matching Problems
ISBN:9789814425247, 9814425249
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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. 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.
Bibliography:Includes bibliographical references (p. 417-460) and index
ISBN:9789814425247
9814425249
DOI:10.1142/8591