{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:39:33Z","timestamp":1773938373137,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T00:00:00Z","timestamp":1464825600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T00:00:00Z","timestamp":1464825600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["482671"],"award-info":[{"award-number":["482671"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["492957"],"award-info":[{"award-number":["492957"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1215990"],"award-info":[{"award-number":["CCF-1215990"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1149888"],"award-info":[{"award-number":["CCF-1149888"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000008","name":"David and Lucile Packard Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000008","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s00453-016-0169-0","type":"journal-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T14:09:17Z","timestamp":1464876557000},"page":"425-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Strategyproof Mechanisms for Competitive Influence in Networks"],"prefix":"10.1007","volume":"78","author":[{"given":"Allan","family":"Borodin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Braverman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brendan","family":"Lucier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joel","family":"Oren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,2]]},"reference":[{"key":"169_CR1","unstructured":"Granovetter, M.: Threshold models of collective behavior. Am. J. Soc. 83, 1420\u20131443 (1978)"},{"key":"169_CR2","volume-title":"Micromotives and Macrobehavior","author":"T Schelling","year":"1978","unstructured":"Schelling, T.: Micromotives and Macrobehavior. Norton, New York (1978)"},{"key":"169_CR3","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1086\/209118","volume":"14","author":"JJ Brown","year":"1987","unstructured":"Brown, J.J., Reingen, P.H.: Social ties and word of mouth referral behavior. J. Consum. Res. 14, 350\u2013362 (1987)","journal-title":"J. Consum. Res."},{"key":"169_CR4","unstructured":"Goldenberg, J., Libai, B., Mulle, E.: Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark. Lett. 12, 211\u2013223 (2001)"},{"key":"169_CR5","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1086\/521848","volume":"113","author":"D Centola","year":"2007","unstructured":"Centola, D., Macy, M.: Complex contagions and the weakness of long ties. Am. J. Sociol. 113, 702\u2013734 (2007)","journal-title":"Am. J. Sociol."},{"key":"169_CR6","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD \u201903: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146. ACM, New York (2003)","DOI":"10.1145\/956750.956769"},{"key":"169_CR7","first-page":"1127","volume-title":"Automata, Languages and Programming. Volume 4858 of Lecture Notes in Computer Science","author":"D Kempe","year":"2005","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G., Monteiro, L., Palamidessi, C., Yung, M. (eds.) Automata, Languages and Programming. Volume 4858 of Lecture Notes in Computer Science, vol. 3580, pp. 1127\u20131138. Springer, Berlin (2005)"},{"key":"169_CR8","doi-asserted-by":"publisher","first-page":"2176","DOI":"10.1137\/080714452","volume":"39","author":"E Mossel","year":"2010","unstructured":"Mossel, E., Roch, S.: Submodularity of influence in social networks: from local to global. SIAM J. Comput. 39, 2176\u20132188 (2010)","journal-title":"SIAM J. Comput."},{"key":"169_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-II. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"169_CR10","doi-asserted-by":"crossref","unstructured":"Carnes, T., Nagarajan, C., Wild, S.M., van Zuylen, A.: Maximizing influence in a competitive social network: a follower\u2019s perspective. In: Proceedings of the Ninth International Conference on Electronic Commerce. ICEC \u201907, pp. 351\u2013360. ACM, New York (2007)","DOI":"10.1145\/1282100.1282167"},{"key":"169_CR11","first-page":"306","volume-title":"Internet and Network Economics. Volume 4858 of Lecture Notes in Computer Science","author":"S Bharathi","year":"2007","unstructured":"Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Deng, X., Graham, F. (eds.) Internet and Network Economics. Volume 4858 of Lecture Notes in Computer Science, vol. 4858, pp. 306\u2013311. Springer, Berlin (2007)"},{"key":"169_CR12","first-page":"539","volume-title":"Internet and Network Economics. Volume 6484 of Lecture Notes in Computer Science","author":"A Borodin","year":"2010","unstructured":"Borodin, A., Filmus, Y., Oren, J.: Threshold models for competitive influence in social networks. In: Saberi, A. (ed.) Internet and Network Economics. Volume 6484 of Lecture Notes in Computer Science, vol. 6484, pp. 539\u2013550. Springer, Berlin (2010)"},{"key":"169_CR13","doi-asserted-by":"crossref","unstructured":"Goyal, S., Kearns, M.: Competitive contagion in networks. In: Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing. STOC \u201912, pp. 759\u2013774. ACM, New York, NY, USA (2012)","DOI":"10.1145\/2213977.2214046"},{"key":"169_CR14","doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: beating 1\u20131\/e. FOCS, pp. 117\u2013126 (2009)","DOI":"10.1109\/FOCS.2009.72"},{"key":"169_CR15","doi-asserted-by":"crossref","unstructured":"Feldman, J., Henzinger, M., Korula, N., Mirrokni, V.S., Stein, C.: Online stochastic packing applied to display ad allocation. In: Proceedings of the 18th Annual European Conference on Algorithms: Part I. ESA\u201910, pp. 182\u2013194. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15775-2_16"},{"key":"169_CR16","doi-asserted-by":"crossref","unstructured":"Borodin, A., Braverman, M., Lucier, B., Oren, J.: Strategyproof mechanisms for competitive influence in networks. In: WWW, pp. 141\u2013150 (2013)","DOI":"10.1145\/2488388.2488402"},{"key":"169_CR17","unstructured":"Goundan, P., Schulz, A.: Revisiting the greedy approach to submodular set function maximization. Optim. Online, 1\u201325 (2007)"},{"key":"169_CR18","first-page":"162","volume-title":"Internet and Network Economics. Volume 4286 of Lecture Notes in Computer Science","author":"P Dubey","year":"2006","unstructured":"Dubey, P., Garg, R., De Meyer, B.: Competing for customers in a social network: the quasi-linear case. In: Spirakis, P., Mavronicolas, M., Kontogiannis, S. (eds.) Internet and Network Economics. Volume 4286 of Lecture Notes in Computer Science, vol. 4286, pp. 162\u2013173. Springer, Berlin (2006)"},{"key":"169_CR19","doi-asserted-by":"crossref","unstructured":"Kostka, J., Oswald, Y.A., Wattenhofer, R.: Word of mouth: rumor dissemination in social networks. In: Proceedings of the 15th International Colloquium on Structural Information and Communication Complexity. SIROCCO \u201908, pp. 185\u2013196. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-69355-0_16"},{"key":"169_CR20","first-page":"212","volume-title":"Algorithmic Game Theory. Volume 6982 of Lecture Notes in Computer Science","author":"K Apt","year":"2011","unstructured":"Apt, K., Markakis, E.: Diffusion in social networks with competing products. In: Persiano, G. (ed.) Algorithmic Game Theory. Volume 6982 of Lecture Notes in Computer Science, vol. 6982, pp. 212\u2013223. Springer, Berlin (2011)"},{"key":"169_CR21","unstructured":"Borodin, A., Braverman, M., Lucier, B., Oren, J.: Truthful mechanisms for competing submodular processes. CoRR. \n                    arXiv:1202.2097\n                    \n                   (2012)"},{"key":"169_CR22","doi-asserted-by":"crossref","unstructured":"Singer, Y.: How to win friends and influence people, truthfully: influence maximization mechanisms for social networks. In: WSDM, pp. 733\u2013742 (2012)","DOI":"10.1145\/2124295.2124381"},{"key":"169_CR23","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-i. Math. Program. 14, 265\u2013294 (1978). doi:\n                    10.1007\/BF01588971","journal-title":"Math. Program."},{"key":"169_CR24","volume-title":"Convex Analysis (Princeton Landmarks in Mathematics and Physics)","author":"RT Rockafellar","year":"1996","unstructured":"Rockafellar, R.T.: Convex Analysis (Princeton Landmarks in Mathematics and Physics). Princeton University Press, Princeton (1996)"},{"key":"169_CR25","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32, 41\u201343 (2004)","journal-title":"Oper. Res. Lett."},{"key":"169_CR26","doi-asserted-by":"crossref","unstructured":"Kulik, A., Shachnai, H., Tamir, T.: Maximizing submodular set functions subject to multiple linear constraints. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201909, pp. 545\u2013554. Society for Industrial and Applied Mathematics, Philadelphia (2009)","DOI":"10.1137\/1.9781611973068.60"},{"key":"169_CR27","doi-asserted-by":"crossref","unstructured":"Lu, P., Sun, X., Wang, Y., Zhu, Z.A.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proceedings of the 11th ACM Conference on Electronic commerce. EC \u201910, pp. 315\u2013324. ACM, New York (2010)","DOI":"10.1145\/1807342.1807393"},{"key":"169_CR28","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Fischer, F., Kash, I., Procaccia, A.D.: Mix and match. In: Proceedings of the 11th ACM Conference on Electronic commerce. EC \u201910, pp. 305\u2013314. ACM, New York (2010)","DOI":"10.1145\/1807342.1807392"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0169-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0169-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0169-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0169-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T06:33:36Z","timestamp":1589697216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0169-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,2]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["169"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0169-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,2]]},"assertion":[{"value":"16 December 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}