Logo der Universität Wien

Mechanisms for the Marriage and the Assignment Game

Abstract

Starting with two models fifty years ago, the discrete marriage game [1] and the continuous assignment game [2], the study of stable matchings has evolved into a rich theory with applications in many areas. Most notably, it has lead to a number of truthful mechanisms that have seen a recent rejuvenation in the context of sponsored search. In this paper we survey the history of these problems and provide several links to ongoing research in the field.

Grafik Top
Authors
Grafik Top
Citation
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
7th International Conference, CIAC 2010,
Divisions
Theory and Applications of Algorithms
Event Location
Italy, Rome
Event Type
Conference
Event Dates
May 26-28, 2010.
ISSN/ISBN
978-3-642-13072-4
Publisher
Springer
Page Range
pp. 6-12
Date
26 May 2010
Export
Grafik Top
Contact us
Faculty of Computer Science
University of Vienna

Währinger Straße 29
A-1090 Vienna