Papier de conférence

Mechanisms for the Marriage and the Assignment Game

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.


  • Aucun fulltext n'est disponible. Veuillez contacter le laboratoire ou les auteurs.

Documents pertinents