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