Maximizing the Spread of Cascades Using Network Design
Daniel Sheldon, Bistra Dilkina, Adam N. Elmachtoub, Ryan Finseth,, Ashish Sabharwal, Jon Conrad, Carla P. Gomes, David Shmoys, William Allen,, Ole Amundsen, William Vaughan

TL;DR
This paper presents a new optimization framework using mixed integer programming to enhance cascade spread in networks, with applications in conservation planning, offering solutions with stochastic optimality guarantees.
Contribution
It introduces a novel MIP-based approach to optimize cascade spread by network modification, combining network design and stochastic optimization techniques.
Findings
Solutions with stochastic optimality guarantees
Conservation strategies that differ from naive approaches
Effective network modifications for cascade maximization
Abstract
We introduce a new optimization framework to maximize the expected spread of cascades in networks. Our model allows a rich set of actions that directly manipulate cascade dynamics by adding nodes or edges to the network. Our motivating application is one in spatial conservation planning, where a cascade models the dispersal of wild animals through a fragmented landscape. We propose a mixed integer programming (MIP) formulation that combines elements from network design and stochastic optimization. Our approach results in solutions with stochastic optimality guarantees and points to conservation strategies that are fundamentally different from naive approaches.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEvolutionary Game Theory and Cooperation · Complex Network Analysis Techniques · Mathematical and Theoretical Epidemiology and Ecology Models
