Journal: Math. Oper. Res.

Volume 42, Issue 4

897 -- 914Paul Dütting, Vasilis Gkatzelis, Tim Roughgarden. The Performance of Deferred-Acceptance Auctions
915 -- 944Vassili Kolokoltsov. The Evolutionary Game of Pressure (or Interference), Resistance and Collaboration
945 -- 978Naci Saldi, Serdar Yüksel, Tamás Linder. On the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces
979 -- 1006Shuangchi He, Dacheng Yao, Hanqin Zhang. Optimal Ordering Policy for Inventory Systems with Quantity-Dependent Setup Costs
1007 -- 1034Nick Whiteley, Nikolas Kantas. Calculating Principal Eigen-Functions of Non-Negative Integral Kernels: Particle Approximations and Applications
1035 -- 1062Gennadiy Averkov, Jan Krümpelmann, Stefan Weltge. Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three
1063 -- 1084Wei Bian, Xiaojun Chen 0001. Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization
1085 -- 1105Xavier Bressaud, Anthony Quas. Dynamical Analysis of a Repeated Game with Incomplete Information
1106 -- 1134Alexander A. Razborov. On the Width of Semialgebraic Proofs and Algorithms
1135 -- 1161Tiziano De Angelis, Salvatore Federico, Giorgio Ferrari. Optimal Boundary Surface for Irreversible Investment with Stochastic Costs
1162 -- 1179János Flesch, Arkadi Predtetchinski. A Characterization of Subgame-Perfect Equilibrium Plays in Borel Games of Perfect Information
1180 -- 1196Nicole Bäuerle, Ulrich Rieder. Partially Observable Risk-Sensitive Markov Decision Processes
1197 -- 1218Maxim Sviridenko, Jan Vondrák, Justin Ward. Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
1219 -- 1229Benjamin Iriarte. Graph Orientations and Linear Extensions
1230 -- 1253Emily Speakman, Jon Lee 0001. Quantifying Double McCormick
1254 -- 1279Massimiliano Amarante. Information and Ambiguity: Toward a Foundation of Nonexpected Utility
1280 -- 1312Ulrich Horst, Michael Paulsen. A Law of Large Numbers for Limit Order Books

Volume 42, Issue 3

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

Volume 42, Issue 2

277 -- 307N. Bora Keskin, Assaf Zeevi. Chasing Demand: Learning and Earning in a Changing Environment
308 -- 329Niv Buchbinder, Moran Feldman, Roy Schwartz. Comparing Apples and Oranges: Query Trade-off in Submodular Maximization
330 -- 348Heinz H. Bauschke, Jérôme Bolte, Marc Teboulle. A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
349 -- 376Jérôme Renault, Xavier Venel. Long-Term Values in Markov Decision Processes and Repeated Games, and a New Distance for Probability Spaces
377 -- 388Iftah Gamzu, Danny Segev. A Sublogarithmic Approximation for Tollbooth Pricing on Trees
389 -- 410Alberto Del Pia, Aida Khajavirad. A Polyhedral Study of Binary Polynomial Programs
411 -- 426Chien-Chung Huang, Telikepalli Kavitha. New Algorithms for Maximum Weight Matching and a Decomposition Theorem
427 -- 433P. Jean-Jacques Herings, Arkadi Predtetchinski. Best-Response Cycles in Perfect Information Games
434 -- 447Itai Feigenbaum, Jay Sethuraman, Chun Ye. p Norm of Costs
448 -- 471Yan Dolinsky, H. Mete Soner. Convex Duality with Transaction Costs
472 -- 494Hamza Fawzi, James Saunderson, Pablo A. Parrilo. Equivariant Semidefinite Lifts of Regular Polygons
495 -- 516Maurice Queyranne, Fabio Tardella. Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities
517 -- 545S. C. P. Yam, W. Zhou. Optimal Liquidation of Child Limit Orders
546 -- 575Lijun Bo, Agostino Capponi. Optimal Credit Investment with Borrowing Costs

Volume 42, Issue 1

1 -- 14Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis. When Is a Network Epidemic Hard to Eliminate?
15 -- 29Yakov Babichenko, Siddharth Barman, Ron Peretz. Empirical Distribution of Equilibrium Play and Its Testing Application
30 -- 56Lijun Bo, Agostino Capponi. Robust Optimization of Credit Portfolios
57 -- 76Yun-Bin Zhao, Zhi-Quan Luo. 1-Algorithms for the Sparsest Points of Polyhedral Sets
77 -- 94Mirjam Dür, Bolor Jargalsaikhan, Georg Still. Genericity Results in Linear Conic Programming - A Tour d'Horizon
95 -- 118Jong-Shi Pang, Meisam Razaviyayn, Alberth Alvarado. Computing B-Stationary Points of Nonsmooth DC Programs
119 -- 134Alexander Engau. Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization
135 -- 143Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli. On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
144 -- 166Stephen R. Chestnut, Rico Zenklusen. Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives
167 -- 178Stefania Minardi, Andrei Savochkin. Characterizations of Smooth Ambiguity Based on Continuous and Discrete Data
179 -- 211László A. Végh. A Strongly Polynomial Algorithm for Generalized Flow Maximization
212 -- 237Kazutoshi Yamazaki. Inventory Control for Spectrally Positive Lévy Demand Processes
238 -- 255Yu Yokoi. A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
256 -- 276Retsef Levi, Robin Roundy, Van Anh Truong, Xinshang Wang. Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models