{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:42:20Z","timestamp":1762623740173,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,5,13]],"date-time":"2013-05-13T00:00:00Z","timestamp":1368403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,5,13]]},"DOI":"10.1145\/2488388.2488402","type":"proceedings-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T20:43:24Z","timestamp":1454705004000},"page":"141-150","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Strategyproof mechanisms for competitive influence in networks"],"prefix":"10.1145","author":[{"given":"Allan","family":"Borodin","sequence":"first","affiliation":[{"name":"University of Toronto, Toronto, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Braverman","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brendan","family":"Lucier","sequence":"additional","affiliation":[{"name":"Microsoft Research New England, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joel","family":"Oren","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,5,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"K.\n       \n      Apt\n     and \n      \n      \n      E.\n       \n      Markakis\n      \n  \n  . \n  Diffusion in social networks with competing products. In G. Persiano editor Algorithmic Game Theory volume \n  6982\n   of \n  Lecture Notes in Computer Science pages \n  212\n  --\n  223\n  . \n  Springer Berlin \/ Heidelberg 2011\n  .   K. Apt and E. Markakis. Diffusion in social networks with competing products. In G. Persiano editor Algorithmic Game Theory volume 6982 of Lecture Notes in Computer Science pages 212--223. Springer Berlin \/ Heidelberg 2011.","DOI":"10.1007\/978-3-642-24829-0_20"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"S.\n       \n      Bharathi D.\n       \n      Kempe and \n      \n      \n      M.\n       \n      Salek\n      \n  \n  . \n  Competitive influence maximization in social networks. In X. Deng and F. Graham editors Internet and Network Economics volume \n  4858\n   of \n  Lecture Notes in Computer Science pages \n  306\n  --\n  311\n  . \n  Springer Berlin \/ Heidelberg 2007\n  .   S. Bharathi D. Kempe and M. Salek. Competitive influence maximization in social networks. In X. Deng and F. Graham editors Internet and Network Economics volume 4858 of Lecture Notes in Computer Science pages 306--311. Springer Berlin \/ Heidelberg 2007.","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"e_1_3_2_1_3_1","unstructured":"A. Borodin M. Braverman B. Lucier and J. Oren. Truthful mechanisms for competing submodular processes. CoRR abs\/1202.2097 2012.  A. Borodin M. Braverman B. Lucier and J. Oren. Truthful mechanisms for competing submodular processes. CoRR abs\/1202.2097 2012."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"A.\n       \n      Borodin Y.\n       \n      Filmus and \n      \n      \n      J.\n       \n      Oren\n      \n  \n  . \n  Threshold models for competitive influence in social networks. In A. Saberi editor Internet and Network Economics volume \n  6484\n   of \n  Lecture Notes in Computer Science pages \n  539\n  --\n  550\n  . \n  Springer Berlin \/ Heidelberg 2010\n  .   A. Borodin Y. Filmus and J. Oren. Threshold models for competitive influence in social networks. In A. Saberi editor Internet and Network Economics volume 6484 of Lecture Notes in Computer Science pages 539--550. Springer Berlin \/ Heidelberg 2010.","DOI":"10.1007\/978-3-642-17572-5_48"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1086\/209118"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282100.1282167"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1086\/521848"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11944874_16"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888935.1888957"},{"key":"e_1_3_2_1_10_1","first-page":"117","article-title":"Online stochastic matching: Beating 1-1\/e","volume":"0","author":"Feldman J.","year":"2009","journal-title":"FOCS"},{"key":"e_1_3_2_1_11_1","first-page":"221","volume-title":"Marketing Letters","author":"Goldenberg J.","year":"2001"},{"key":"e_1_3_2_1_12_1","unstructured":"P. Goundan and A. Schulz. Revisiting the greedy approach to submodular set function maximization. Optimization online (1984): 1--25 2007.  P. Goundan and A. Schulz. Revisiting the greedy approach to submodular set function maximization. Optimization online (1984):1--25 2007."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214046"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","DOI":"10.1086\/226707","article-title":"Threshold models of collective behavior","author":"Granovetter M.","year":"1978","journal-title":"American Journal of Sociology, (83):1420--1443"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_91"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69355-0_16"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496830"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/080714452"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_1_22_1","unstructured":"R. T. Rockafellar. Convex Analysis (Princeton Landmarks in Mathematics and Physics). Princeton University Press December 1996.  R. T. Rockafellar. Convex Analysis (Princeton Landmarks in Mathematics and Physics). Princeton University Press December 1996."},{"volume-title":"Norton","year":"1978","author":"Schelling T.","key":"e_1_3_2_1_23_1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124381"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"}],"event":{"name":"WWW '13: 22nd International World Wide Web Conference","sponsor":["NICBR Nucleo de Informatcao e Coordenacao do Ponto BR","CGIBR Comite Gestor da Internet no Brazil","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Rio de Janeiro Brazil","acronym":"WWW '13"},"container-title":["Proceedings of the 22nd international conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488388.2488402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2488388.2488402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:41Z","timestamp":1750236521000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2488388.2488402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,13]]},"references-count":25,"alternative-id":["10.1145\/2488388.2488402","10.1145\/2488388"],"URL":"https:\/\/doi.org\/10.1145\/2488388.2488402","relation":{},"subject":[],"published":{"date-parts":[[2013,5,13]]},"assertion":[{"value":"2013-05-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}