Content
August 2017, Volume 42, Issue 3
- 599-625 Optimal Dynamic Risk Taking
by Ajay Subramanian & Baozhong Yang - 626-647 An ɛ -Nash Equilibrium with High Probability for Strategic Customers in Heavy Traffic
by Rami Atar & Subhamay Saha - 648-661 A Generalization of the Borkar-Meyn Theorem for Stochastic Recursive Inclusions
by Arunselvan Ramaswamy & Shalabh Bhatnagar - 662-691 Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
by Bingsheng He & Min Tao & Xiaoming Yuan - 692-722 The Power of Slightly More than One Sample in Randomized Load Balancing
by Lei Ying & R. Srikant & Xiaohan Kang - 723-744 Scheduling Using Interactive Optimization Oracles for Constrained Queueing Networks
by Tonghoon Suk & Jinwoo Shin - 745-761 Matroids Are Immune to Braess’ Paradox
by Satoru Fujishige & Michel X. Goemans & Tobias Harks & Britta Peis & Rico Zenklusen - 762-782 Efficient Reinforcement Learning in Deterministic Systems with Value Function Generalization
by Zheng Wen & Benjamin Van Roy - 783-805 Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
by Damek Davis & Wotao Yin - 806-833 Optimal Stopping Under Probability Distortions
by Denis Belomestny & Volker Krätschmer - 834-853 Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
by Etienne de Klerk & Jean B. Lasserre & Monique Laurent & Zhao Sun - 854-875 Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints
by Jean-Philippe Gayon & Guillaume Massonnet & Christophe Rapine & Gautier Stauffer - 876-896 Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
by Anupam Gupta & Viswanath Nagarajan & R. Ravi
May 2017, Volume 42, Issue 2
- 277-307 Chasing Demand: Learning and Earning in a Changing Environment
by N. Bora Keskin & Assaf Zeevi - 308-329 Comparing Apples and Oranges: Query Trade-off in Submodular Maximization
by Niv Buchbinder & Moran Feldman & Roy Schwartz - 330-348 A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
by Heinz H. Bauschke & Jérôme Bolte & Marc Teboulle - 349-376 Long-Term Values in Markov Decision Processes and Repeated Games, and a New Distance for Probability Spaces
by Jérôme Renault & Xavier Venel - 377-388 A Sublogarithmic Approximation for Tollbooth Pricing on Trees
by Iftah Gamzu & Danny Segev - 389-410 A Polyhedral Study of Binary Polynomial Programs
by Alberto Del Pia & Aida Khajavirad - 411-426 New Algorithms for Maximum Weight Matching and a Decomposition Theorem
by Chien-Chung Huang & Telikepalli Kavitha - 427-433 Best-Response Cycles in Perfect Information Games
by P. Jean-Jacques Herings & Arkadi Predtetchinski - 434-447 Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing L p Norm of Costs
by Itai Feigenbaum & Jay Sethuraman & Chun Ye - 448-471 Convex Duality with Transaction Costs
by Yan Dolinsky & H. Mete Soner - 472-494 Equivariant Semidefinite Lifts of Regular Polygons
by Hamza Fawzi & James Saunderson & Pablo A. Parrilo - 495-516 Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities
by Maurice Queyranne & Fabio Tardella - 517-545 Optimal Liquidation of Child Limit Orders
by S. C. P. Yam & W. Zhou - 546-575 Optimal Credit Investment with Borrowing Costs
by Lijun Bo & Agostino Capponi
January 2017, Volume 42, Issue 1
- 256-276 Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models
by Retsef Levi & Robin Roundy & Van Anh Truong & Xinshang Wang