Robust decision making for stochastic network design

• Main Authors: Akshat KUMAR, SINGH, Arambam James, Pradeep VARAKANTHAM, SHELDON, Daniel
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2016
• Subjects: Artificial Intelligence and Robotics; OS and Networks
• Online Access: https://ink.library.smu.edu.sg/sis_research/3606; https://ink.library.smu.edu.sg/context/sis_research/article/4607/viewcontent/RSND.pdf
• Institution: Singapore Management University

We address the problem of robust decision making for stochastic network design. Our work is motivated by spatial conservation planning where the goal is to take management decisions within a fixed budget to maximize the expected spread of a population of species over a network of land parcels. Most previous work for this problem assumes that accurate estimates of different network parameters (edge activation probabilities, habitat suitability scores) are available, which is an unrealistic assumption. To address this shortcoming, we assume that network parameters are only partially known, specified via interval bounds. We then develop a decision making approach that computes the solution with minimax regret. We provide new theoretical results regarding the structure of the minmax regret solution which help develop a computationally efficient approach. Empirically, we show that previous approaches that work on point estimates of network parameters result in high regret on several standard benchmarks, while our approach provides significantly more robust solutions.