Journal: Math. Oper. Res.

Volume 44, Issue 4

1145 -- 1160Mark E. Lewis, Anand Paul. Uniform Turnpike Theorems for Finite Markov Decision Processes
1161 -- 1173James T. Hungerford, Francesco Rinaldi. A General Regularized Continuous Formulation for the Maximum Clique Problem
1174 -- 1191Massimo Marinacci, Luigi Montrucchio. Unique Tarski Fixed Points
1192 -- 1207Amir Ali Ahmadi, Georgina Hall. On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity
1208 -- 1220Amitabh Basu, Michele Conforti, Marco Di Summa, Giacomo Zambelli. Optimal Cutting Planes from the Group Relaxations
1221 -- 1244Simon Bruggmann, Rico Zenklusen. Submodular Maximization Through the Lens of Linear Programming
1245 -- 1263Marcel Nutz, Yuchong Zhang. A Mean Field Competition
1264 -- 1285Amitabh Basu, R. Kipp Martin, Christopher Thomas Ryan, Guanyi Wang. Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions - Modeling Implications
1286 -- 1303José R. Correa, Jasper de Jong, Bart de Keijzer, Marc Uetz. The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing
1304 -- 1325AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Brendan Lucier, Hamid Mahini, Saeed Seddighin. From Duels to Battlefields: Computing Equilibria of Blotto and Other Games
1326 -- 1344Takashi Kunimoto, Roberto Serrano. Rationalizable Implementation of Correspondences
1345 -- 1380Mor Armony, Rami Atar, Harsha Honnappa. Asymptotically Optimal Appointment Schedules
1381 -- 1395Tien Son Pham. Optimality Conditions for Minimizers at Infinity in Polynomial Programming
1396 -- 1411Ngoc Mai Tran, Josephine Yu. Product-Mix Auctions and Tropical Geometry
1412 -- 1430Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat. The Structure of the Infinite Models in Integer Programming
1431 -- 1449Robbert Fokkink, Thomas Lidbetter, László A. Végh. On Submodular Search and Machine Scheduling
1450 -- 1476Vasilis Syrgkanis, David Kempe 0001, Éva Tardos. Information Asymmetries in Common-Value Auctions with Discrete Signals
1477 -- 1493Jean B. Lasserre, Youssouf Emin. Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets
1494 -- 1509Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen. An Improved Analysis of Local Search for Max-Sum Diversification

Volume 44, Issue 3

767 -- 782Ori Haimanko. The Banzhaf Value and General Semivalues for Differentiable Mixed Games
783 -- 792Vincent Conitzer. The Exact Computational Complexity of Evolutionarily Stable Strategies
793 -- 820Joey Huchette, Juan Pablo Vielma. A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints
821 -- 864Gianmarco Bet, Remco van der Hofstad, Johan S. H. van Leeuwaarden. Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations
865 -- 889Omer Ben-Porat, Moshe Tennenholtz. Multiunit Facility Location Games
890 -- 918Kyomin Jung, Yingdong Lu, Devavrat Shah, Mayank Sharma, Mark S. Squillante. Revisiting Stochastic Loss Networks: Structures and Approximations
919 -- 942Bohan Chen, Jose H. Blanchet, Chang-han Rhee, Bert Zwart. Efficient Rare-Event Simulation for Multiple Jump Events in Regularly Varying Random Walks and Compound Poisson Processes
943 -- 965Zhen Xu, Jiheng Zhang, Rachel Q. Zhang. Instantaneous Control of Brownian Motion with a Positive Lead Time
966 -- 987Jakub Trybula, Dariusz Zawisza. Continuous-Time Portfolio Choice Under Monotone Mean-Variance Preferences - Stochastic Factor Case
988 -- 1005Niv Buchbinder, Moran Feldman. Constrained Submodular Maximization via a Nonsymmetric Technique
1006 -- 1033Naci Saldi, Tamer Basar, Maxim Raginsky. Approximate Nash Equilibria in Partially Observed Stochastic Games with Mean-Field Interactions
1034 -- 1057Matteo Burzoni, Marco Frittelli, Zhaoxu Hou, Marco Maggis, Jan Oblój. Pointwise Arbitrage Pricing Theory in Discrete Time
1058 -- 1086Saeed Alaei, Hu Fu, Nima Haghpanah, Jason D. Hartline, Azarakhsh Malekian. Efficient Computation of Optimal Auctions via Reduced Forms
1087 -- 1100Jinyan Fan, Jiawang Nie, Anwa Zhou. Completely Positive Binary Tensors
1101 -- 1121Martin Gairing, Rahul Savani. Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
1122 -- 1144Desmond W. H. Cai, Subhonmesh Bose, Adam Wierman. On the Role of a Market Maker in Networked Cournot Competition

Volume 44, Issue 2

377 -- 399Aurélien Garivier, Pierre Ménard, Gilles Stoltz. Explore First, Exploit Next: The True Shape of Regret in Bandit Problems
400 -- 422Daniel Lacker, Kavita Ramanan. Rare Nash Equilibria and the Price of Anarchy in Large Static Games
423 -- 439Thomas Kruse, Philipp Strack. An Inverse Optimal Stopping Problem for Diffusion Processes
440 -- 467Romuald Elie, Thibaut Mastrolia, Dylan Possamaï. A Tale of a Principal and Many, Many Agents
468 -- 486Erhan Bayraktar, Zhou Zhou. No-Arbitrage and Hedging with Liquid American Options
487 -- 511Ali Aouad, Retsef Levi, Danny Segev. Approximation Algorithms for Dynamic Assortment Optimization Models
512 -- 531Tiziano De Angelis, Giorgio Ferrari, John Moriarty. A Solvable Two-Dimensional Degenerate Singular Stochastic Control Problem with Nonconvex Costs
532 -- 564Erhun Özkan, Amy R. Ward. On the Control of Fork-Join Networks
565 -- 600Jose H. Blanchet, Karthyek R. A. Murthy. Quantifying Distributional Model Risk via Optimal Transport
601 -- 631Qi (George) Chen, Stefanus Jasin, Izak Duenyas. Nonparametric Self-Adjusting Control for Joint Learning and Optimization of Multiproduct Pricing with Finite Resource Capacity
632 -- 650Ya-Feng Liu, Xin Liu 0033, Shiqian Ma. On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming
651 -- 667Peter I. Frazier, Shane G. Henderson, Rolf Waeber. Probabilistic Bisection Converges Almost as Quickly as Stochastic Approximation
668 -- 692Wang Chi Cheung, David Simchi-Levi. Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models
693 -- 714Jose H. Blanchet, Xinyun Chen. Perfect Sampling of Generalized Jackson Networks
715 -- 738Minh N. Dao, Hung M. Phan. Linear Convergence of Projection Algorithms
739 -- 766Asaf Cohen 0003. Brownian Control Problems for a Multiclass M/M/1 Queueing Problem with Model Uncertainty

Volume 44, Issue 1

1 -- 18Javier Peña, Daniel Rodríguez. Polytope Conditioning and Linear Convergence of the Frank-Wolfe Algorithm
19 -- 37Yongchao Liu, Alois Pichler, Huifu Xu. Discrete Approximation and Quantification in Distributionally Robust Optimization
38 -- 57Thanasis Lianeas, Evdokia Nikolova, Nicolás E. Stier Moses. Risk-Averse Selfish Routing
58 -- 73Nabil Kahalé. Efficient Simulation of High Dimensional Gaussian Vectors
74 -- 101Antônio Francisco Neto. Generating Functions of Weighted Voting Games, MacMahon's Partition Analysis, and Clifford Algebras
102 -- 121Alexander Schied, Tao Zhang. A Market Impact Game Under Transient Price Impact
122 -- 146Boris Pittel. On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women
147 -- 172Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson. ɛ
173 -- 195Yun-Bin Zhao, Houyuan Jiang, Zhi-Quan Luo. 1-Minimization Methods in Sparse Data Reconstruction
196 -- 211Paul Dütting, Felix A. Fischer, David C. Parkes. Expressiveness and Robustness of First-Price Position Auctions
212 -- 235Gaëtan Fournier, Marco Scarsini. Location Games on Networks: Existence and Efficiency of Equilibria
236 -- 263Alfredo N. Iusem, Alejandro Jofré, Philip Thompson. Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities
264 -- 276Sébastien Bubeck, Ronen Eldan. The Entropic Barrier: Exponential Families, Log-Concave Geometry, and Self-Concordance
277 -- 302Fabien Gensbittel, Christine Grün. Zero-Sum Stopping Games with Asymmetric Information
303 -- 333Kenichiro Shiraya, Akihiko Takahashi. Pricing Average and Spread Options Under Local-Stochastic Volatility Jump-Diffusion Models
334 -- 353Wanmo Kang, Jong Mun Lee. Unbiased Sensitivity Estimation of One-Dimensional Diffusion Processes
354 -- 375Jian Li, Amol Deshpande. Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems