Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems

DOI10.1109/FOCS.2011.33zbMath1292.90251MaRDI QIDQ5495043

Jian Li, Amol Deshpande

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (9)

Sequence Independent Lifting for the Set of Submodular Maximization Problem ⋮ Approximation algorithms for stochastic combinatorial optimization problems ⋮ Optimal halting policies in Markov population decision chains with constant risk posture ⋮ Maximizing a class of submodular utility functions with constraints ⋮ A fully polynomial-time approximation scheme for approximating a sum of random variables ⋮ Maximizing expected utility over a knapsack constraint ⋮ Risk-Averse Selfish Routing ⋮ Stochastic Load Balancing on Unrelated Machines ⋮ Constant risk aversion in stochastic contests with exponential completion times

This page was built for publication: Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems