%ABanerjee, Siddhartha%AFreund, Daniel%Anull Ed.%BJournal Name: ACM SIGMETRICS Performance Evaluation Review; Journal Volume: 48; Journal Issue: 1 %D2020%I %JJournal Name: ACM SIGMETRICS Performance Evaluation Review; Journal Volume: 48; Journal Issue: 1 %K %MOSTI ID: 10240309 %PMedium: X %TUniform Loss Algorithms for Online Stochastic Decision-Making With Applications to Bin Packing %XWe consider a general class of finite-horizon online decision-making problems, where in each period a controller is presented a stochastic arrival and must choose an action from a set of permissible actions, and the final objective depends only on the aggregate type-action counts. Such a framework encapsulates many online stochastic variants of common optimization problems including bin packing, generalized assignment, and network revenue management. In such settings, we study a natural model-predictive control algorithm that in each period, acts greedily based on an updated certainty-equivalent optimization problem. We introduce a simple, yet general, condition under which this algorithm obtains uniform additive loss (independent of the horizon) compared to an optimal solution with full knowledge of arrivals. Our condition is fulfilled by the above-mentioned problems, as well as more general settings involving piece-wise linear objectives and offline index policies, including an airline overbooking problem. %0Journal Article