{"date_updated":"2023-02-09T09:19:49Z","type":"conference","extern":"1","publication_identifier":{"isbn":["9781450311564"]},"language":[{"iso":"eng"}],"author":[{"full_name":"Dütting, Paul","first_name":"Paul","last_name":"Dütting"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Weber, Ingmar","first_name":"Ingmar","last_name":"Weber"}],"conference":{"start_date":"2012-10-29","end_date":"2012-11-02","name":"CIKM: Conference on Information and Knowledge Management","location":"Maui, HI, United States"},"doi":"10.1145/2396761.2398621","_id":"11656","title":"Maximizing revenue from strategic recommendations under decaying trust","scopus_import":"1","quality_controlled":"1","publication_status":"published","publication":"Proceedings of the 21st ACM international conference on Information and knowledge management","oa_version":"None","abstract":[{"text":"Suppose your sole interest in recommending a product to me is to maximize the amount paid to you by the seller for a sequence of recommendations. How should you recommend optimally if I become more inclined to ignore you with each irrelevant recommendation you make? Finding an answer to this question is a key challenge in all forms of marketing that rely on and explore social ties; ranging from personal recommendations to viral marketing.\r\n\r\nWe prove that even if the recommendee regains her initial trust on each successful recommendation, the expected revenue the recommender can make over an infinite period due to payments by the seller is bounded. This can only be overcome when the recommendee also incrementally regains trust during periods without any recommendation. Here, we see a connection to \"banner blindness,\" suggesting that showing fewer ads can lead to a higher long-term revenue.","lang":"eng"}],"article_processing_charge":"No","citation":{"apa":"Dütting, P., Henzinger, M. H., &#38; Weber, I. (2012). Maximizing revenue from strategic recommendations under decaying trust. In <i>Proceedings of the 21st ACM international conference on Information and knowledge management</i> (pp. 2268–2286). Maui, HI, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/2396761.2398621\">https://doi.org/10.1145/2396761.2398621</a>","ista":"Dütting P, Henzinger MH, Weber I. 2012. Maximizing revenue from strategic recommendations under decaying trust. Proceedings of the 21st ACM international conference on Information and knowledge management. CIKM: Conference on Information and Knowledge Management, 2268–2286.","chicago":"Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “Maximizing Revenue from Strategic Recommendations under Decaying Trust.” In <i>Proceedings of the 21st ACM International Conference on Information and Knowledge Management</i>, 2268–86. Association for Computing Machinery, 2012. <a href=\"https://doi.org/10.1145/2396761.2398621\">https://doi.org/10.1145/2396761.2398621</a>.","ieee":"P. Dütting, M. H. Henzinger, and I. Weber, “Maximizing revenue from strategic recommendations under decaying trust,” in <i>Proceedings of the 21st ACM international conference on Information and knowledge management</i>, Maui, HI, United States, 2012, pp. 2268–2286.","short":"P. Dütting, M.H. Henzinger, I. Weber, in:, Proceedings of the 21st ACM International Conference on Information and Knowledge Management, Association for Computing Machinery, 2012, pp. 2268–2286.","mla":"Dütting, Paul, et al. “Maximizing Revenue from Strategic Recommendations under Decaying Trust.” <i>Proceedings of the 21st ACM International Conference on Information and Knowledge Management</i>, Association for Computing Machinery, 2012, pp. 2268–86, doi:<a href=\"https://doi.org/10.1145/2396761.2398621\">10.1145/2396761.2398621</a>.","ama":"Dütting P, Henzinger MH, Weber I. Maximizing revenue from strategic recommendations under decaying trust. In: <i>Proceedings of the 21st ACM International Conference on Information and Knowledge Management</i>. Association for Computing Machinery; 2012:2268-2286. doi:<a href=\"https://doi.org/10.1145/2396761.2398621\">10.1145/2396761.2398621</a>"},"date_created":"2022-07-27T06:47:53Z","month":"10","page":"2268-2286","status":"public","year":"2012","publisher":"Association for Computing Machinery","day":"29","date_published":"2012-10-29T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}