Duetting, PaulHenzinger, Monika2011-12-162011-12-162011-12-16201010.1007/978-3-642-13073-1_2https://infoscience.epfl.ch/handle/20.500.14299/75387WOS:000279393400002Starting 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.stable matchingsauction mechanismsmatching marketsMechanisms for the Marriage and the Assignment Gametext::conference output::conference proceedings::conference paper