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