| 577 | -- | 598 | Michael O'Sullivan, Arthur F. Veinott Jr.. n-Present-Value Optimal Policies in Markov Decision Chains |
| 599 | -- | 625 | Ajay Subramanian, Baozhong Yang. Optimal Dynamic Risk Taking |
| 626 | -- | 647 | Rami Atar, Subhamay Saha. ɛ-Nash Equilibrium with High Probability for Strategic Customers in Heavy Traffic |
| 648 | -- | 661 | Arunselvan Ramaswamy, Shalabh Bhatnagar. A Generalization of the Borkar-Meyn Theorem for Stochastic Recursive Inclusions |
| 662 | -- | 691 | Bingsheng He, Min Tao, Xiaoming Yuan. Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming |
| 692 | -- | 722 | Lei Ying, R. Srikant, Xiaohan Kang. The Power of Slightly More than One Sample in Randomized Load Balancing |
| 723 | -- | 744 | Tonghoon Suk, Jinwoo Shin. Scheduling Using Interactive Optimization Oracles for Constrained Queueing Networks |
| 745 | -- | 761 | Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen. Matroids Are Immune to Braess' Paradox |
| 762 | -- | 782 | Zheng Wen, Benjamin Van Roy. Efficient Reinforcement Learning in Deterministic Systems with Value Function Generalization |
| 783 | -- | 805 | Damek Davis, Wotao Yin. Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions |
| 806 | -- | 833 | Denis Belomestny, Volker Krätschmer. Optimal Stopping Under Probability Distortions |
| 834 | -- | 853 | Etienne de Klerk, Jean B. Lasserre, Monique Laurent, Zhao Sun. Bound-Constrained Polynomial Optimization Using Only Elementary Calculations |
| 854 | -- | 875 | Jean-Philippe Gayon, Guillaume Massonnet, Christophe Rapine, Gautier Stauffer. Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints |
| 876 | -- | 896 | Anupam Gupta, Viswanath Nagarajan, R. Ravi 0001. Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems |