Optimal budget allocation: Theoretical guarantee and efficient algorithm

31st International Conference on Machine Learning, ICML 2014

Volumn 1, Issue , 2014, Pages 556-568

  Soma, Tasuku ^a,b   Kakimura, Naonori ^a   Inaba, Kazuhiro ^c   Kawarabayashi, Ken Ichi ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^c GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALUMINUM; APPROXIMATION ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; LEARNING SYSTEMS;

BUDGET ALLOCATION; BUDGET CONSTRAINT; INFLUENCE MAXIMIZATIONS; INFLUENCE MODEL; INTEGER LATTICE; KNAPSACK CONSTRAINTS; SUBMODULAR FUNCTIONS; THEORETICAL GUARANTEES;

BUDGET CONTROL;

EID: 84919785397     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Yahoo. webscope dataset: ydata-ysm-advertiser-bidsvl-0.http ://research.yahoo.com/Academic-Relations.
2. Alon, N., Gamzu, I., and Tennenholtz, M. Optimizing budget allocation among channels and influencers. In Proceedings of the 21st International Conference on World Wide Web, pp. 381-388, 2012.
3. Bharathi, S., Kempe, D., and Salek, M. Competitive influence maximization in social networks. In Proceedings of the 3rd International Conference on Internet and Network Economics, WINE'07, pp. 306-311, 2007.
4. Borgs, C, Brautbar, M., Chayes, J., and Lucier, B. Maximizing social influence in nearly optimal time. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SODA' 14, 2014.
5. Borodin, A., Filmus, Y., and Oren, J. Threshold models for competitive influence in social networks. In Proceedings of the 6th International Conference on Internet and Network Economics, WINE'10, pp. 539-550, 2010.
6. Budak, C, Agrawal, D., and El Abbadi, A. Limiting the spread of misinformation in social networks. In Proceedings of the 20th International Conference on World Wide Web, WWW ' 11, pp. 665-674, 2011.
7. Chen, W., Wang, Y, and Yang, S. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199-208. ACM, 2009.
8. Chen, W., Wang, C, and Wang, Y. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029-1038. ACM, 2010.
9. Domingos, P. and Richardson, M. Mining the network value of customers. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57-66. ACM, 2001.
10. Feige, U. A threshold of In n for approximating set cover. Journal of ACM, 45:634-652, 1998.
11. Filatova, E. and Hatzivassiloglou, V. Event-based extractive summarization. In Proceedings of ACL Workshop on Summarization, 2004.
12. Fisher, M. L., Nemhauser, G. L., and Wolsey, L. A. An analysis of approximations for maximizing submodular set functions ii. Mathematical Programming Study, 8:73-87, 1978.
13. Fujishige, S. Submodular Functions and Optimizations. Number 58 in Annals of Discrete Mathematics. Elsevier, 2nd edition, 2005.
14. Iwata, S. Submodular function minimization. Math. Program., 112(1):45-64, 2008.
15. Jiang, Q., Song, G., Gao, C, Wang, Y., Si, W., and Xie, K. Simulated annealing based influence maximazation in social networks. In Proceedings of the Twenty-fifth Conference on Artificial Intelligence, pp. 127-132. AAAI, 2011.
16. Kempe, D., Kleinberg, J., and Tardos, E. Maximizing the spread of influence through a social network. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137-146. ACM, 2003.
17. Krause, A. and Golovin, D. Submodular function maximization. In Bordeaux, L., Hamadi, Y., and Kohli, P. (eds.), Tractability: Practical Approaches to Hard Problems, to appear. Cambridge University Press, 2014.
18. Leskovec, J., Krause, A., Guestrin, C, Faloutsos, C, VanBriesen, J., and Glance, N. S. Cost-effective outbreak detetion in networks. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420-429. ACM, 2007.
19. Lin, H. and Bilmes, J. Multi-document summarization via budgeted maximization of submodular functions. In Proceedings of the Annual Conference of the North American Chapter of the Association for Computational Linguistics, pp. 912-920, 2010.
20. Lin, H. and Bilmes, J. A class of submodular functions for document summarization. In Proceedings of the Annual Conference of the North American Chapter of the Association for Computational Linguistics, pp. 510-520, 2011.
21. Minoux, M. Accelerated greedy algorithms for maximizing submodular set functions. Optimization Techniques, Lecture Notes in Control and Information Sciences, 7:234-243, 1978.
22. Nemhauser, G., Wolsey, L., and Fisher, M. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14:265-294, 1978.
23. Richardson, M. and Domingos, P. Mining knowledge-sharing sites for viral marcketing. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61-70. ACM, 2002.
24. Shioura, A. On the pipage rounding algorithm for submodular function maximization - a view from discrete convex analysis. Discrete Math., Alg. andAppl, 1(1):1-24, 2009.
25. Singh, AP, Guillory, A., and Bilmes, J. On bisubmodular maximization. In Proceedings of the 15th International Conference on Artificial Intelligence and Statistics, pp. 1055-1063, 2012.
26. Soma, T., Kakimura, N., Inaba, K., and Kawarabayashi, K. Optimal budget allocation: Theoretical guarantee and efficient algorithm (extended version). 2014. URL http://www.opt.mist.i.u-tokyo.ac.jp/-tasuku/papers/icm.2014.pdf.
27. Sviridenko, M. A note on maximizing a submodular set function subject to a knapsack constraint. Operations Research Letters, 32:41-43, 2004.