@inproceedings{11798,
  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.},
  author       = {Dütting, Paul and Henzinger, Monika H},
  booktitle    = {7th International Conference on Algorithms and Complexity},
  isbn         = {9783642130724},
  issn         = {1611-3349},
  location     = {Rome, Italy},
  pages        = {6–12},
  publisher    = {Springer Nature},
  title        = {{Mechanisms for the marriage and the assignment game}},
  doi          = {10.1007/978-3-642-13073-1_2},
  volume       = {6078},
  year         = {2010},
}