Mechanisms for the marriage and the assignment game LNCS Dütting, Paul Henzinger, Monika H ; https://orcid.org/0000-0002-5008-6530 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. Springer Nature 2010 info:eu-repo/semantics/conferenceObject doc-type:conferenceObject text http://purl.org/coar/resource_type/c_5794 https://research-explorer.ista.ac.at/record/11798 Dütting P, Henzinger M. Mechanisms for the marriage and the assignment game. In: <i>7th International Conference on Algorithms and Complexity</i>. Vol 6078. Springer Nature; 2010:6–12. doi:<a href="https://doi.org/10.1007/978-3-642-13073-1_2">10.1007/978-3-642-13073-1_2</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-13073-1_2 info:eu-repo/semantics/altIdentifier/issn/1611-3349 info:eu-repo/semantics/altIdentifier/isbn/9783642130724 info:eu-repo/semantics/closedAccess