Request Username
Can't sign in? Forgot your username?
Enter your email address below and we will send you your username
Research Articles
Polynomial-Time Computation of Strong and n-Present-Value Optimal Policies in Markov Decision Chains
Pages:577–598
Published Online:December 14, 2016
An ɛ-Nash Equilibrium with High Probability for Strategic Customers in Heavy Traffic
Pages:626–647
Published Online:December 14, 2016
A Generalization of the Borkar-Meyn Theorem for Stochastic Recursive Inclusions
Pages:648–661
Published Online:December 16, 2016
Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
Pages:662–691
Published Online:February 7, 2017
The Power of Slightly More than One Sample in Randomized Load Balancing
Pages:692–722
Published Online:February 24, 2017
Scheduling Using Interactive Optimization Oracles for Constrained Queueing Networks
Pages:723–744
Published Online:February 24, 2017
Efficient Reinforcement Learning in Deterministic Systems with Value Function Generalization
Pages:762–782
Published Online:March 2, 2017
Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
Pages:783–805
Published Online:February 24, 2017
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
Pages:834–853
Published Online:March 15, 2017
Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints
Pages:854–875
Published Online:March 9, 2017
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
Pages:876–896
Published Online:March 3, 2017
