Highly Influenced

# Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems

@article{Li2011MaximizingEU, title={Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems}, author={Jian Li and Amol Deshpande}, journal={2011 IEEE 52nd Annual Symposium on Foundations of Computer Science}, year={2011}, pages={797-806} }

- Published 2011 in 2011 IEEE 52nd Annual Symposium on Foundations of…
DOI:10.1109/FOCS.2011.33

We study the stochastic versions of a broad class of combinatorial problems where the weights of the elements in the input dataset are uncertain. The class of problems that we study includes shortest paths, minimum weight spanning trees, and minimum weight matchings over probabilistic graphs, and other combinatorial problems like knapsack. We observe that the expected value is inadequate in capturing different types of {\em risk-averse} or {\em risk-prone} behaviors, and instead we consider a… CONTINUE READING