Loading...
conference paper
Mechanisms for the Marriage and the Assignment Game
2010
Algorithms And Complexity, Proceedings
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.
Type
conference paper
Web of Science ID
WOS:000279393400002
Authors
Publication date
2010
Published in
Algorithms And Complexity, Proceedings
ISBN of the book
978-3-642-13072-4
Series title/Series vol.
Lecture Notes in Computer Science; 6078
Start page
6
End page
12
EPFL units
Event name | Event place | Event date |
Rome, ITALY | May 26-28, 2010 | |
Available on Infoscience
December 16, 2011
Use this identifier to reference this record