Lagrangian decomposition algorithm for allocating marketing channels

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2015, Pages 1144-1150

  Hatano, Daisuke ^a   Fukunaga, Takuro ^a   Maehara, Takanori ^a   Kawarabayashi, Ken Ichi ^a  

^a JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMMERCE; LAGRANGE MULTIPLIERS; MARKETING;

COMPUTATIONAL ADVERTISINGS; INFLUENCE MAXIMIZATIONS; LAGRANGIAN DECOMPOSITION; MARKETING CHANNELS; MATCH-MAKER; PARALLEL ENVIRONMENT;

ALGORITHMS;

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

References (27)

1. Abrams, Z.; Goel, A.; and Plotkin, S. A. 2004. Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In IPSN, 424-432.
2. Ageev, A. A., and Sviridenko, M. 2004. Pipage rounding: A new method of constructing algorithms with proven performance guarantee. J. Comb. Optim. 8(3):307-328.
3. Alon, N.; Gamzu, 1.; and Tennenholtz, M. 2012. Optimizing budget allocation among channels and influencers. In WWW, 381-388.
4. Bertsekas, D. P. 1999. Nonlinear programming. Athena Scientific.
5. Borgs, C; Brautbar, M.; Chayes, J.; and Lucier, B. 2014. Maximizing social influence in nearly optimal time. In SODA, 946-957.
6. Calinescu, G.; Chekuri, C.; Pal, M.; and Vondrak, J. 2011. Maximizing a monotone submodular function subject to a matroid constraint. SI AM J. Comput. 40(6): 1740-1766.
7. Chen, W.; Wang, C; and Wang, Y. 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD, 1029-1038.
8. Chen, W.; Wang, Y.; and Yang, S. 2009. Efficient influence maximization in social networks. In KDD, 199-208.
9. Du, N.; Song, L.; Gomez-Rodriguez, M.; and Zha, H. 2013. Scalable influence estimation in continuous-time diffusion networks. In NIPS, 3147-3155.
10. Feige, U.; Immorlica, N.; Mirrokni, V. S.; and Nazerzadeh, H. 2013. PASS approximation: A framework for analyzing and designing heuristics. Algorithmica 66(2):450-478.
11. Feldman, J.; Henzinger, M.; Korula, N.; Mirrokni, V. S.; and Stein, C. 2010. Online stochastic packing applied to display ad allocation. InESA, 182-194.
12. Fisher, M. L.; Nemhauser, G. L.; and Wolsey, L. A. 1978. An analysis of approximations for maximizing submodular set functions-II. Math. Prog. Study 8:73-87.
13. Goel, A.; Mahdian, M.; Nazerzadeh, H.; and Saberi, A. 2010. Advertisement allocation for generalized second-pricing schemes. Oper. Res. Lett. 38(6):571-576.
14. Guignard, M.; Kim, S. 1987. Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Math. Program. 39(2):215-228.
15. Hatano, D., and Hirayama, K. 2011. Dynamic SAT with decision change costs: Formalization and solutions. In IJCAI, 560-565.
16. Held, M.; Wolfe, P.; and Crowder, H. P. 1974. Validation of subgradient optimization. Math. Prog. 6( 1 ):62-88.
17. Hirayama, K. 2006. Distributed Lagrangean relaxation protocol for the generalized mutual assignment problem. In AAMAS, 890-892.
18. Kempe, D.; Kleinberg, J.; and Tardos, E. 2003. Maximizing the spread of influence through a social network. In KDD, 137-146.
19. Khot, S.; Lipton, R. J.; Markakis, E.; and Mehta, A. 2008. Inapproximability results for combinatorial auctions with submodular utility functions. Algorithmica 52(1):3-18.
20. Kleinberg, J. M.; Papadimitriou, C. H.; and Raghavan, P. 2004. Segmentation problems. J. ACM 51 (2):263-280.
21. Komodakis, N.; Paragios, N.; and Tziritas, G. 2007. MRF optimization via dual decomposition: Message-passing revisited. In ICCV, 1-8.
22. Lehmann, B.; Lehmann, D.; and Nisan, N. 2006. Combinatorial auctions with decreasing marginal utilities. Games andEcon. Behav. 55:270-296.
23. Nemhauser, G.; Wolsey, L.; and Fisher, M. 1978. An analysis of the approximations for maximizing submodular set functions-I. Math. Prog. 14:265-294.
24. Romero, D. M.; Meeder, B.; and Kleinberg, J. M. 2011. Differences in the mechanics of information diffusion across topics: idioms, political hashtags, and complex contagion on twitter. In WWW, 695-704.
25. Rush, A. M., and Collins, M. 2014. A tutorial on dual decomposition and Lagrangian relaxation for inference in natural language processing. CoRR abs/1405.5208.
26. Soma, T.; Kakimura, N.; Inaba, K.; and Kawarabayashi, K. 2014. Optimal budget allocation: Theoretical guarantee and efficient algorithm. In ICML, 351-359.
27. Sviridenko, M. 2004. A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32:41-43.