Abstract
We study the problem of maximizing the amount of stochastic diffusion in a network by acquiring nodes within a certain limited budget. We use a Sample Average Approximation (SAA) scheme to translate this stochastic problem into a simulation-based deterministic optimization problem, and present a detailed empirical study of three variants of the problem: where all purchases are made upfront, where the budget is split but one still commits to purchases from the outset, and where one has the ability to observe the stochastic outcome of the first stage in order to “re-plan” for the second stage. We apply this to a Red Cockaded Woodpecker conservation problem. Our results show interesting runtime distributions and objective value patterns, as well as a delicate trade-off between spending all budget upfront vs. saving part of it for later.
Supported by NSF (Expeditions in Computing award for Computational Sustainability, 0832782; IIS grant 0514429) & AFOSR (IISI, grant FA9550-04-1-0151). The authors thank Yahoo! for generously providing access to their M45 compute cloud.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Ahmed. Introduction to stochastic integer programming. COSP Stochastic Programming Introduction – http://stoprog.org , 2004.
Anderson, R., May, R.: Infectious diseases of humans: dynamics and control. Oxford University Press, Oxford (1992)
Conner, R., Rudolph, D., Walters, J., James, F.: The Red-cockaded Woodpecker: surviving in a fire-maintained ecosystem. Univ. of Texas Press (2001)
Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD, pp. 57–66 (2001), ISBN 1-58113-391-X
US Fish and Wildlife Service. Red-cockaded woodpecker recovery plan (2003)
Goldenberg, J., Libai, B., Muller, E.: Talk of the network: A complex systems look at word-of-mouth. Marketing Letters 12(3), 211–223 (2001)
Gomes, C.P.: Computational Sustainability: Computational methods for a sustainable environment, economy, and society. The Bridge, NAE 39(4) (2009)
Hanski, I.: Metapopulation ecology. Oxford University Press, USA (1999)
IBM ILOG, SA. CPLEX 12.1 Reference Manual (2009)
Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: KDD, pp. 137–146 (2003)
Leskovec, J., Adamic, L., Huberman, B.: The dynamics of viral marketing. ACM Transactions on the Web (TWEB) 1(1), 5 (2007)
Letcher, B.H., Priddy, J.A., Walters, J.R., Crowder, L.B.: An individual-based, spatially-explicit simulation model of the population dynamics of the endangered red-cockaded woodpecker, picoides borealis. Biol. Conserv. 86(1), 1–14 (1998)
McDonald-Madden, E., Baxter, P.W., Possingham, H.P.: Making robust decisions for conservation with restricted money and knowledge. Appl. Ecol. 45(9), 1630–1638 (2008)
Shapiro, A.: Monte Carlo sampling methods. In: Ruszczynski, A., Shapiro, A. (eds.) Stochastic Programming. Handbooks in Operations Research and Management Science, vol. 10, pp. 353–426 (2003)
Sheldon, D., Dilkina, B., Elmachtoub, A., Finseth, R., Sabharwal, A., Conrad, J., Gomes, C.P., Shmoys, D., Allen, W., Amundsen, O., Vaughan, B.: Optimal network design for the spread of cascades. Technical report, Cornell University (April 2010), http://hdl.handle.net/1813/14917
The USGS Land Cover Institute (LCI). USGS land cover (2001)
US Census Bereau. Census data: 2009 TIGER/Line shapefiles (2009)
Verweij, B., Ahmed, S., Kleywegt, A., Nemhauser, G., Shapiro, A.: The sample average approximation method applied to stochastic routing problems: a computational study. Computational Optimiz. and Applications 24(2), 289–333 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahmadizadeh, K., Dilkina, B., Gomes, C.P., Sabharwal, A. (2010). An Empirical Study of Optimization for Maximizing Diffusion in Networks. In: Cohen, D. (eds) Principles and Practice of Constraint Programming – CP 2010. CP 2010. Lecture Notes in Computer Science, vol 6308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15396-9_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-15396-9_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15395-2
Online ISBN: 978-3-642-15396-9
eBook Packages: Computer ScienceComputer Science (R0)