4 citations · 4 across the 2 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2009★ 3 cited
Approximate Dynamic Programming via a Smoothed Linear Program
V. V. Desai, V. F. Farias, C. C. Moallemi
We present a novel linear program for the approximation of the dynamic programming cost-to-go function in high-dimensional stochastic control problems. LP approaches to approximate…
math.OC2008★ 4 cited
Irrevocable Multi-Armed Bandit Policies
Vivek Farias, Ritesh Madan
This paper considers the multi-armed bandit problem with multiple simultaneous arm pulls. We develop a new `irrevocable' heuristic for this problem. In particular, we do not allow…
math.OC2008
Stochastic Depletion Problems: Effective Myopic Policies for a class of Dynamic Optimization Problems
Carri W. Chan, Vivek F. Farias
This paper presents a general class of dynamic stochastic optimization problems we refer to as Stochastic Depletion Problems. A number of challenging dynamic optimization problems…