From post

Maximizing the Spread of Influence through a Social Network

, , и . Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, стр. 137–146. New York, NY, USA, Association for Computing Machinery, (2003)
DOI: 10.1145/956750.956769

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Bayesian sequential auctions., и . EC, стр. 929-944. ACM, (2012)Frugal path mechanisms., и . ACM Trans. Algorithms, 3 (1): 3:1-3:22 (2007)Invited Articles Foreword.. J. ACM, 63 (2): 18:1 (2016)Generalized polymatroids and submodular flows., и . Math. Program., 42 (1-3): 489-563 (1988)Network games.. STOC, стр. 341-342. ACM, (2004)Small-loss bounds for online learning with partial information., , и . COLT, том 75 из Proceedings of Machine Learning Research, стр. 979-986. PMLR, (2018)Invited Article Foreword.. J. ACM, 65 (6): 44:1 (2018)Near-Optimal Network Design with Selfish Agents., , , и . Theory of Computing, 4 (1): 77-109 (2008)Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations., и . WINE, том 11316 из Lecture Notes in Computer Science, стр. 246-263. Springer, (2018)Approximation Algorithms and Network Games.. ESA, том 2832 из Lecture Notes in Computer Science, стр. 6. Springer, (2003)