---
_id: '11798'
abstract:
- lang: eng
  text: 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.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Paul
  full_name: Dütting, Paul
  last_name: Dütting
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
citation:
  ama: '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>'
  apa: 'Dütting, P., &#38; Henzinger, M. (2010). Mechanisms for the marriage and the
    assignment game. In <i>7th International Conference on Algorithms and Complexity</i>
    (Vol. 6078, pp. 6–12). Rome, Italy: Springer Nature. <a href="https://doi.org/10.1007/978-3-642-13073-1_2">https://doi.org/10.1007/978-3-642-13073-1_2</a>'
  chicago: Dütting, Paul, and Monika Henzinger. “Mechanisms for the Marriage and the
    Assignment Game.” In <i>7th International Conference on Algorithms and Complexity</i>,
    6078:6–12. Springer Nature, 2010. <a href="https://doi.org/10.1007/978-3-642-13073-1_2">https://doi.org/10.1007/978-3-642-13073-1_2</a>.
  ieee: P. Dütting and M. Henzinger, “Mechanisms for the marriage and the assignment
    game,” in <i>7th International Conference on Algorithms and Complexity</i>, Rome,
    Italy, 2010, vol. 6078, pp. 6–12.
  ista: 'Dütting P, Henzinger M. 2010. Mechanisms for the marriage and the assignment
    game. 7th International Conference on Algorithms and Complexity. CIAC: International
    Conference on Algorithms and Complexity, LNCS, vol. 6078, 6–12.'
  mla: Dütting, Paul, and Monika Henzinger. “Mechanisms for the Marriage and the Assignment
    Game.” <i>7th International Conference on Algorithms and Complexity</i>, vol.
    6078, Springer Nature, 2010, pp. 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>.
  short: P. Dütting, M. Henzinger, in:, 7th International Conference on Algorithms
    and Complexity, Springer Nature, 2010, pp. 6–12.
conference:
  end_date: 2010-05-28
  location: Rome, Italy
  name: 'CIAC: International Conference on Algorithms and Complexity'
  start_date: 2010-05-26
date_created: 2022-08-11T12:27:43Z
date_published: 2010-05-01T00:00:00Z
date_updated: 2024-11-06T08:15:13Z
day: '01'
doi: 10.1007/978-3-642-13073-1_2
extern: '1'
intvolume: '      6078'
language:
- iso: eng
month: '05'
oa_version: None
page: 6–12
publication: 7th International Conference on Algorithms and Complexity
publication_identifier:
  isbn:
  - '9783642130724'
  issn:
  - 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mechanisms for the marriage and the assignment game
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6078
year: '2010'
...