{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:15:46Z","timestamp":1773152146767,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319218397","type":"print"},{"value":"9783319218403","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_35","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"422-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Competitive Diffusion on Weighted Graphs"],"prefix":"10.1007","author":[{"given":"Takehiro","family":"Ito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yota","family":"Otachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiki","family":"Saitoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisayuki","family":"Satoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kei","family":"Uchizawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsuhisa","family":"Yamanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"issue":"6","key":"35_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ipl.2009.12.009","volume":"110","author":"N Alon","year":"2010","unstructured":"Alon, N., Feldman, M., Procaccia, A.D., Tennenholtz, M.: A note on competitive diffusion through social networks. Information Processing Letters 110(6), 221\u2013225 (2010)","journal-title":"Information Processing Letters"},{"issue":"3","key":"35_CR2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.3233\/FI-2014-970","volume":"129","author":"KR Apt","year":"2014","unstructured":"Apt, K.R., Markakis, E.: Social networks with competing products. Fundamenta Informaticae 129(3), 225\u2013250 (2014)","journal-title":"Fundamenta Informaticae"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-77105-0_31","volume-title":"Internet and Network Economics","author":"S Bharathi","year":"2007","unstructured":"Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 306\u2013311. Springer, Heidelberg (2007)"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Borodin, A., Braverman, M., Lucier, B., Oren, J.: Strategyproof mechanisms for competitive influence in networks. In: Proc. of the 22nd International Conference on World Wide Web, pp. 141\u2013151 (2013)","DOI":"10.1145\/2488388.2488402"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-17572-5_48","volume-title":"Internet and Network Economics","author":"A Borodin","year":"2010","unstructured":"Borodin, A., Filmus, Y., Oren, J.: Threshold models for competitive influence in social networks. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 539\u2013550. Springer, Heidelberg (2010)"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Bulteau, L., Froese, V., Talmon, N.: Multi-Player diffusion games on graph classes. In: Proc. of the 12th Annual Conference on Theory and Applications of Models of Computation (to appear)","DOI":"10.1080\/15427951.2016.1197167"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Clark, A., Poovendran, R.: Maximizing influence in competitive environments: a game-theoretic approach. In: Proc. of the Second International Conference on Decision and Game Theory for Security, pp. 151\u2013162","DOI":"10.1007\/978-3-642-25280-8_13"},{"issue":"4","key":"35_CR8","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s11786-010-0041-6","volume":"3","author":"C Cooper","year":"2010","unstructured":"Cooper, C., Uehara, R.: Scale Free Properties of Random $$k$$-Trees. Mathematics in Computer Science 3(4), 489\u2013496 (2010)","journal-title":"Mathematics in Computer Science"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proc. of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Draief, M., Heidari, H., Kearns, M.: New models for competitive contagion. In: Proc. of the 28th AAAI Conference on Artificial Intelligence, pp. 637\u2013644 (2014)","DOI":"10.1609\/aaai.v28i1.8809"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"D\u00fcrr, C., Thang, N.K.: Nash equilibria in Voronoi games on graphs. In: Proc. of the 15th Annual European Symposium on Algorithms, pp. 17\u201328 (2007)","DOI":"10.1007\/978-3-540-75520-3_4"},{"key":"35_CR12","unstructured":"Etesami, S.R., Basar, T.: Complexity of equilibrium in diffusion games on social networks. 1403.3881"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-10841-9_26","volume-title":"Internet and Network Economics","author":"R Feldmann","year":"2009","unstructured":"Feldmann, R., Mavronicolas, M., Monien, B.: Nash equilibria for voronoi games on transitive graphs. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 280\u2013291. Springer, Heidelberg (2009)"},{"key":"35_CR14","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series (2006)"},{"key":"35_CR15","unstructured":"Goyal, S., Heidari, H., Kearns, M.: Competitive contagion in networks. Games and Economic Behavior (to appear)"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"He, X., Kempe, D.: Price of anarchy for the N-player competitive cascade game with submodular activation functions. In: Proc. of the 9th International Workshop on Internet and Network Economics, pp. 232\u2013248 (2013)","DOI":"10.1007\/978-3-642-45046-4_20"},{"key":"35_CR17","first-page":"87","volume":"14","author":"P Heggernes","year":"2008","unstructured":"Heggernes, P., Kratsch, D.: Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nordic Journal of Computing 14, 87\u2013108 (2008)","journal-title":"Nordic Journal of Computing"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer-Verlag (2004)","DOI":"10.1007\/978-3-540-24777-7"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proc. of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"35_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1007\/11523468_91","volume-title":"Automata, Languages and Programming","author":"D Kempe","year":"2005","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127\u20131138. Springer, Heidelberg (2005)"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Monien, B., Papadopoulou, V.G., Schoppmann, F.: Voronoi games on cycle graphs. In: Proc. of the 33rd International Symposium on Mathematical Foundations of Computer Science, pp. 503\u2013514 (2008)","DOI":"10.1007\/978-3-540-85238-4_41"},{"key":"35_CR22","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proc. of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61\u201370 (2002)","DOI":"10.1145\/775047.775057"},{"issue":"7","key":"35_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ipl.2013.01.011","volume":"113","author":"L Small","year":"2013","unstructured":"Small, L., Mason, O.: Nash Equilibria for competitive information diffusion on trees. Information Processing Letters 113(7), 217\u2013219 (2013)","journal-title":"Information Processing Letters"},{"issue":"3","key":"35_CR24","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ipl.2011.10.015","volume":"112","author":"R Takehara","year":"2012","unstructured":"Takehara, R., Hachimori, M., Shigeno, M.: A comment on pure-strategy Nash equilibria in competitive diffusion games. Information Processing Letters 112(3), 59\u201360 (2012)","journal-title":"Information Processing Letters"},{"issue":"4","key":"35_CR25","doi-asserted-by":"publisher","first-page":"485","DOI":"10.7155\/jgaa.00235","volume":"15","author":"S Teramoto","year":"2011","unstructured":"Teramoto, S., Demaine, E.D., Uehara, R.: The Voronoi game on graphs and its complexity. Journal of Graph Algorithms and Applications 15(4), 485\u2013501 (2011)","journal-title":"Journal of Graph Algorithms and Applications"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:35:26Z","timestamp":1674567326000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}