Mathematics of Operations Research

2017 - 2025

From INFORMS
Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 50, issue 1, 2025

The Online Saddle Point Problem and Online Convex Optimization with Knapsacks pp. 1-39

Adrian Rivera Cardoso, He Wang and Huan Xu

Towards Optimal Problem Dependent Generalization Error Bounds in Statistical Learning Theory pp. 40-67

Yunbei Xu and Assaf Zeevi

Flow Allocation Games pp. 68-89

Nils Bertschinger, Martin Hoefer and Daniel Schmand

Polynomial Voting Rules pp. 90-106

Wenpin Tang and David D. Yao

Scheduling in the High-Uncertainty Heavy Traffic Regime pp. 107-140

Rami Atar, Eyal Castiel and Yonatan Shadmi

Alternating and Parallel Proximal Gradient Methods for Nonsmooth, Nonconvex Minimax: A Unified Convergence Analysis pp. 141-168

Eyal Cohen and Marc Teboulle

Fluctuation Theory of Continuous-Time, Skip-Free Downward Markov Chains with Applications to Branching Processes with Immigration pp. 169-188

Ronnie Loeffen, Pierre Patie and Jian Wang

Submodular Functions and Perfect Graphs pp. 189-208

Tara Abrishami, Maria Chudnovsky, Cemil Dibek and Kristina Vušković

Stationary Points of a Shallow Neural Network with Quadratic Activations and the Global Optimality of the Gradient Descent Algorithm pp. 209-251

David Gamarnik, Eren C. Kızıldağ and Ilias Zadik

A Characterization of Simultaneous Optimization, Majorization, and (Bi-)Submodular Polyhedra pp. 252-276

Martijn H. H. Schoot Uiterkamp

Variational Inequalities on Unbounded Domains for Zero-Sum Singular Controller vs. Stopper Games pp. 277-312

Andrea Bovo, Tiziano De Angelis and Elena Issoglio

Risk Sharing with Lambda Value at Risk pp. 313-333

Peng Liu

Strongly Convergent Homogeneous Approximations to Inhomogeneous Markov Jump Processes and Applications pp. 334-355

Martin Bladt and Oscar Peralta

Optimal Consumption and Investment with Independent Stochastic Labor Income pp. 356-389

Alain Bensoussan and Seyoung Park

On the (Im-)Possibility of Representing Probability Distributions as a Difference of I.I.D. Noise Terms pp. 390-409

Christian Ewerhart and Marco Serena

Parametric Semidefinite Programming: Geometry of the Trajectory of Solutions pp. 410-430

Antonio Bellon, Didier Henrion, Vyacheslav Kungurtsev and Jakub Mareček

A Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDP pp. 431-458

Mehrdad Moharrami, Yashaswini Murthy, Arghyadip Roy and R. Srikant

Convergence and Stability of Coupled Belief-Strategy Learning Dynamics in Continuous Games pp. 459-481

Manxi Wu, Saurabh Amin and Asuman Ozdaglar

Marginal Values of a Stochastic Game pp. 482-505

Luc Attia, Miquel Oliu-Barton and Raimundo Saona

Mean-Field Multiagent Reinforcement Learning: A Decentralized Network Approach pp. 506-536

Haotian Gu, Xin Guo, Xiaoli Wei and Renyuan Xu

Semidefinite Approximations for Bicliques and Bi-Independent Pairs pp. 537-572

Monique Laurent, Sven Polak and Luis Felipe Vargas

Multilevel Langevin Pathwise Average for Gibbs Approximation pp. 573-605

Maxime Egéa and Fabien Panloup

Optimal Investment Strategy for α-Robust Utility Maximization Problem pp. 606-632

Zhou Yang, Danping Li, Yan Zeng and Guanting Liu

Fast Rates for the Regret of Offline Reinforcement Learning pp. 633-655

Yichun Hu, Nathan Kallus and Masatoshi Uehara

Exact Characterization of the Jointly Optimal Restocking and Auditing Policy in Inventory Systems with Record Inaccuracy pp. 656-710

Naveed Chehrazi

Sample-Path Large Deviations for Unbounded Additive Functionals of the Reflected Random Walk pp. 711-742

Mihail Bazhba, Jose Blanchet, Chang-Han Rhee and Bert Zwart

Uniqueness of Convex-Ranged Probabilities and Applications to Risk Measures and Games pp. 743-763

Massimiliano Amarante, Felix-Benedikt Liebrich and Cosimo Munari

Steiner Cut Dominants pp. 764-781

Michele Conforti and Volker Kaibel

Volume 49, issue 4, 2024

Robustness of Stochastic Optimal Control to Approximate Diffusion Models Under Several Cost Evaluation Criteria pp. 2049-2077

Somnath Pradhan and Serdar Yüksel

A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond pp. 2078-2108

Martin Nägele and Rico Zenklusen

The Complexity of Pacing for Second-Price Auctions pp. 2109-2135

Xi Chen, Christian Kroer and Rachitesh Kumar

Unbiased Time-Average Estimators for Markov Chains pp. 2136-2165

Nabil Kahalé

Finding Hall Blockers by Matrix Scaling pp. 2166-2179

Koyo Hayashi, Hiroshi Hirai and Keiya Sakabe

Fair-Share Allocations for Agents with Arbitrary Entitlements pp. 2180-2211

Moshe Babaioff, Tomer Ezra and Uriel Feige

A Stochastic Sequential Quadratic Optimization Algorithm for Nonlinear-Equality-Constrained Optimization with Rank-Deficient Jacobians pp. 2212-2248

Albert S. Berahas, Frank E. Curtis, Michael J. O’Neill and Daniel P. Robinson

A Class of Dissimilarity Semimetrics for Preference Relations pp. 2249-2270

Hiroki Nishimura and Efe A. Ok

Fluid Limits for Longest Remaining Time First Queues pp. 2271-2294

Łukasz Kruk

V-Learning—A Simple, Efficient, Decentralized Algorithm for Multiagent Reinforcement Learning pp. 2295-2322

Chi Jin, Qinghua Liu, Yuanhao Wang and Tiancheng Yu

Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number pp. 2323-2340

Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta and Pranabendu Misra

Extreme-Case Distortion Risk Measures: A Unification and Generalization of Closed-Form Solutions pp. 2341-2355

Hui Shao and Zhe George Zhang

A Mean-Field Control Problem of Optimal Portfolio Liquidation with Semimartingale Strategies pp. 2356-2384

Guanxing Fu, Ulrich Horst and Xiaonyu Xia

The Cost of Nonconvexity in Deterministic Nonsmooth Optimization pp. 2385-2401

Siyu Kong and A. S. Lewis

Worst-Case Iteration Bounds for Log Barrier Methods on Problems with Nonconvex Constraints pp. 2402-2424

Oliver Hinder and Yinyu Ye

Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness pp. 2425-2445

Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi and Rebecca Reiffenhäuser

Proximity and Flatness Bounds for Linear Integer Optimization pp. 2446-2467

Marcel Celaya, Stefan Kuhlmann, Joseph Paat and Robert Weismantel

Linear Program-Based Policies for Restless Bandits: Necessary and Sufficient Conditions for (Exponentially Fast) Asymptotic Optimality pp. 2468-2491

Nicolas Gast, Bruno Gaujal and Chen Yan

Convergence Analysis of Accelerated Stochastic Gradient Descent Under the Growth Condition pp. 2492-2526

You-Lin Chen, Sen Na and Mladen Kolar

Quantitative Convergence for Displacement Monotone Mean Field Games with Controlled Volatility pp. 2527-2564

Joe Jackson and Ludovic Tangpi

The Iterates of the Frank–Wolfe Algorithm May Not Converge pp. 2565-2578

Jérôme Bolte, Cyrille W. Combettes and Edouard Pauwels

Counting and Enumerating Optimum Cut Sets for Hypergraph k -Partitioning Problems for Fixed k pp. 2579-2601

Calvin Beideman, Karthekeyan Chandrasekaran and Weihang Wang

Zero-One Composite Optimization: Lyapunov Exact Penalty and a Globally Convergent Inexact Augmented Lagrangian Method pp. 2602-2625

Penghe Zhang, Naihua Xiu and Ziyan Luo

Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location pp. 2626-2651

Priyank Agrawal, Eric Balkanski, Vasilis Gkatzelis, Tingting Ou and Xizhi Tan

Limit Theorems for Default Contagion and Systemic Risk pp. 2652-2683

Hamed Amini, Zhongyuan Cao and Agnès Sulem

Diffusion-Based Staffing for Multitasking Service Systems with Many Servers pp. 2684-2722

Jaap Storm, Wouter Berkelmans and René Bekker

The Multi-Objective Polynomial Optimization pp. 2723-2748

Jiawang Nie and Zi Yang

The Privacy Paradox and Optimal Bias–Variance Trade-offs in Data Acquisition pp. 2749-2767

Guocheng Liao, Yu Su, Juba Ziani, Adam Wierman and Jianwei Huang

Strategy-Proof Multidimensional Mechanism Design pp. 2768-2785

Ranojoy Basu and Conan Mukherjee

Joint Mixability and Notions of Negative Dependence pp. 2786-2802

Takaaki Koike, Liyuan Lin and Ruodu Wang

Volume 49, issue 2, 2024

Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue pp. 653-674

Alon Eden, Michal Feldman, Amos Fiat, Kira Goldner and Anna R. Karlin

Large Ranking Games with Diffusion Control pp. 675-696

Stefan Ankirchner, Nabil Kazi-Tani, Julian Wendt and Chao Zhou

Solving Optimization Problems with Blackwell Approachability pp. 697-728

Julien Grand-Clément and Christian Kroer

A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem pp. 729-751

Hao Hu, Xinxin Li, Haesol Im and Henry Wolkowicz

Numeraire-Invariant Quadratic Hedging and Mean–Variance Portfolio Allocation pp. 752-781

Aleš Černý, Christoph Czichowsky and Jan Kallsen

On Geometric Connections of Embedded and Quotient Geometries in Riemannian Fixed-Rank Matrix Optimization pp. 782-825

Yuetian Luo, Xudong Li and Anru R. Zhang

A Simple Characterization of Supply Correspondences pp. 826-831

Alexey Kushnir and Vinod Krishnamoorthy

A Unified Analysis of a Class of Proximal Bundle Methods for Solving Hybrid Convex Composite Optimization Problems pp. 832-855

Jiaming Liang and Renato D. C. Monteiro

Secretaries with Advice pp. 856-879

Paul Dütting, Silvio Lattanzi, Renato Paes Leme and Sergei Vassilvitskii

Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes pp. 880-900

Yuval Emek, Ron Lavi, Rad Niazadeh and Yangguang Shi

Nontruthful Position Auctions Are More Robust to Misspecification pp. 901-927

Paul Dütting, Felix Fischer and David C. Parkes

Minimization Fractional Prophet Inequalities for Sequential Procurement pp. 928-947

Junjie Qin, Shai Vardi and Adam Wierman

Asymptotically Optimal Control of Make-to-Stock Systems pp. 948-985

Xuefeng Gao and Junfei Huang

Scalable Computation of Dynamic Flow Problems via Multimarginal Graph-Structured Optimal Transport pp. 986-1011

Isabel Haasler, Axel Ringh, Yongxin Chen and Johan Karlsson

A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming pp. 1012-1044

Sen Na, Mihai Anitescu and Mladen Kolar

Quickest Detection Problems for Ornstein–Uhlenbeck Processes pp. 1045-1064

Kristoffer Glover and Goran Peskir

Nash Equilibrium Problems of Polynomials pp. 1065-1090

Jiawang Nie and Xindong Tang

Zero-Sum Games and Linear Programming Duality pp. 1091-1108

Bernhard von Stengel

Satiation in Fisher Markets and Approximation of Nash Social Welfare pp. 1109-1139

Jugal Garg, Martin Hoefer and Kurt Mehlhorn

Minimizing Compositions of Differences-of-Convex Functions with Smooth Mappings pp. 1140-1168

Hoai An Le Thi, Huynh Van Ngai and Tao Pham Dinh

Probabilistic Bounds on the k -Traveling Salesman Problem and the Traveling Repairman Problem pp. 1169-1191

Moïse Blanchard, Alexandre Jacquillat and Patrick Jaillet

Managing Customer Churn via Service Mode Control pp. 1192-1222

Yash Kanoria, Ilan Lobel and Jiaqi Lu

Convergence Rates for Regularized Optimal Transport via Quantization pp. 1223-1240

Stephan Eckstein and Marcel Nutz

The Secretary Problem with Predictions pp. 1241-1262

Kaito Fujii and Yuichi Yoshida

Extension of Additive Valuations to General Valuations on the Existence of EFX pp. 1263-1277

Ryoga Mahara

Binary Matrix Factorization and Completion via Integer Programming pp. 1278-1302

Oktay Günlük, Raphael Andreas Hauser and Réka Ágnes Kovács