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 47, issue 4, 2022

Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis pp. 2547-2584

Jinhak Kim, Mohit Tawarmalani and Jean-Philippe P. Richard

A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint pp. 2585-2613

Ningyuan Chen and Guillermo Gallego

Local Density Estimation in High Dimensions pp. 2614-2640

Xian Wu, Moses Charikar and Vishnu Natchu

Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems pp. 2641-2666

Ion Necoara and Olivier Fercoq

An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint pp. 2667-2690

Naor Alaluf, Alina Ene, Moran Feldman, Huy L. Nguyen and Andrew Suh

Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies pp. 2691-2720

Weina Wang, Siva Theja Maguluri, R. Srikant and Lei Ying

A Unified Framework for Bayesian and Non-Bayesian Decision Making and Inference pp. 2721-2742

Massimiliano Amarante

Equilibria in Multiclass and Multidimensional Atomic Congestion Games pp. 2743-2764

Max Klimm and Andreas Schütz

The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property pp. 2765-2783

Xianfu Wang and Ziyuan Wang

Suboptimal Local Minima Exist for Wide Neural Networks with Smooth Activations pp. 2784-2814

Tian Ding, Dawei Li and Ruoyu Sun

Satisficing in Time-Sensitive Bandit Learning pp. 2815-2839

Daniel Russo and Benjamin Van Roy

Finite State Mean Field Games with Wright–Fisher Common Noise as Limits of N -Player Weighted Games pp. 2840-2890

Erhan Bayraktar, Alekos Cecchin, Asaf Cohen and François Delarue

McKean–Vlasov Optimal Control: Limit Theory and Equivalence Between Different Formulations pp. 2891-2930

Mao Fabrice Djete, Dylan Possamaï and Xiaolu Tan

A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition pp. 2931-2949

Guyan Ni and Ying Li

Distributionally Robust Chance Constrained Geometric Optimization pp. 2950-2988

Jia Liu, Abdel Lisser and Zhiping Chen

On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization pp. 2989-3009

Jonathan D. Hauenstein, Ali Mohammad-Nezhad, Tingting Tang and Tamás Terlaky

Stackelberg Max Closure with Multiple Followers pp. 3010-3024

Karsten Jungnitsch, Britta Peis and Marc Schröder

Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem pp. 3025-3050

Rujun Jiang and Xudong Li

Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization pp. 3051-3083

Junyi Liu, Ying Cui and Jong-Shi Pang

Forbidden Transactions and Black Markets pp. 3084-3109

Chenlin Gu, Alvin Roth and Qingyun Wu

Gale’s Fixed Tax for Exchanging Houses pp. 3110-3128

Tommy Andersson, Lars Ehlers, Lars-Gunnar Svensson and Ryan Tierney

Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling pp. 3129-3155

Daniela Andrea Hurtado Lange and Siva Theja Maguluri

A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem pp. 3156-3183

Rob Van Eynde and Mario Vanhoucke

Examples of Pathological Dynamics of the Subgradient Method for Lipschitz Path-Differentiable Functions pp. 3184-3206

Rodolfo Ríos-Zertuche

Pipeline Interventions pp. 3207-3238

Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth and Juba Ziani

Entropy Regularization for Mean Field Games with Learning pp. 3239-3260

Xin Guo, Renyuan Xu and Thaleia Zariphopoulou

Bounding Residence Times for Atomic Dynamic Routings pp. 3261-3281

Zhigang Cao, Bo Chen, Xujin Chen and Changjun Wang

Slater Condition for Tangent Derivatives pp. 3282-3303

Xi Yin Zheng

Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems pp. 3304-3316

Javier Peña and Negar Soheili

Adaptive Bin Packing with Overflow pp. 3317-3356

Sebastian Perez-Salazar, Mohit Singh and Alejandro Toriello

Consensus Halving for Sets of Items pp. 3357-3379

Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi and Warut Suksompong

Hypergraph k -Cut for Fixed k in Deterministic Polynomial Time pp. 3380-3399

Karthekeyan Chandrasekaran and Chandra Chekuri

Volume 47, issue 3, 2022

A Stochastic Representation for Nonlocal Parabolic PDEs with Applications pp. 1707-1730

Min Dai, Steven Kou and Chen Yang

The Buck-Passing Game pp. 1731-1756

Roberto Cominetti, Matteo Quattropani and Marco Scarsini

Distributionally Robust Markov Decision Processes and Their Connection to Risk Measures pp. 1757-1780

Nicole Bäuerle and Alexander Glauner

Equilibria and Systemic Risk in Saturated Networks pp. 1781-1801

Leonardo Massai, Giacomo Como and Fabio Fagnani

Optimal Retirement Under Partial Information pp. 1802-1832

Kexin Chen, Junkee Jeon and Hoi Ying Wong

A Class of Recursive Optimal Stopping Problems with Applications to Stock Trading pp. 1833-1861

Katia Colaneri and Tiziano De Angelis

Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems pp. 1862-1874

David Gamarnik, John N. Tsitsiklis and Martin Zubeldia

Fair Cake Division Under Monotone Likelihood Ratios pp. 1875-1903

Siddharth Barman and Nidhi Rathi

Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability pp. 1904-1931

David Simchi-Levi and Yunzong Xu

Sparse Solutions of a Class of Constrained Optimization Problems pp. 1932-1956

Lei Yang, Xiaojun Chen and Shuhuang Xiang

Consumption Smoothing and Discounting in Infinite-Horizon, Discrete-Choice Problems pp. 1957-1969

Jeremy Kettering and Asen Kochov

Fully Polynomial-Time Approximation Schemes for Fair Rent Division pp. 1970-1998

Eshwar Ram Arunachaleswaran, Siddharth Barman and Nidhi Rathi

Impact of Network Structure on New Service Pricing pp. 1999-2033

Saed Alizamir, Ningyuan Chen, Sang-Hyun Kim and Vahideh Manshadi

Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization pp. 2034-2064

Zhengling Qi, Ying Cui, Yufeng Liu and Jong-Shi Pang

Parametric Shortest-Path Algorithms via Tropical Geometry pp. 2065-2081

Michael Joswig and Benjamin Schröter

Distributed Stochastic Optimization with Large Delays pp. 2082-2111

Zhengyuan Zhou, Panayotis Mertikopoulos, Nicholas Bambos, Peter Glynn and Yinyu Ye

Optimal Electricity Demand Response Contracting with Responsiveness Incentives pp. 2112-2137

René Aïd, Dylan Possamaï and Nizar Touzi

Analyzing Approximate Value Iteration Algorithms pp. 2138-2159

Arunselvan Ramaswamy and Shalabh Bhatnagar

On Optimality Conditions for Nonlinear Conic Programming pp. 2160-2185

Roberto Andreani, Walter Gómez, Gabriel Haeser, Leonardo M. Mito and Alberto Ramos

Small-Loss Bounds for Online Learning with Partial Information pp. 2186-2218

Thodoris Lykouris, Karthik Sridharan and Éva Tardos

On Degenerate Doubly Nonnegative Projection Problems pp. 2219-2239

Ying Cui, Ling Liang, Defeng Sun and Kim-Chuan Toh

Correlated Equilibria and Mean Field Games: A Simple Model pp. 2240-2259

Luciano Campi and Markus Fischer

Penalty and Augmented Lagrangian Methods for Constrained DC Programming pp. 2260-2285

Zhaosong Lu, Zhe Sun and Zirui Zhou

Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online pp. 2286-2309

Georgios Amanatidis, Pieter Kleer and Guido Schäfer

Asymptotically Optimal Sequential Design for Rank Aggregation pp. 2310-2332

Xi Chen, Yunxiao Chen and Xiaoou Li

A Result on Convergence of Sequences of Iterations with Applications to Best-Response Dynamics pp. 2333-2343

Wojciech Olszewski

Second-Order Optimality Conditions for Nonconvex Set-Constrained Optimization Problems pp. 2344-2365

Helmut Gfrerer, Jane J. Ye and Jinchuan Zhou

One-Step Estimation with Scaled Proximal Methods pp. 2366-2386

Robert Bassett and Julio Deride

Distributionally Robust Inventory Control When Demand Is a Martingale pp. 2387-2414

Linwei Xin and David Alan Goldberg

Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs pp. 2415-2443

Radu Ioan Boţ, Minh N. Dao and Guoyin Li

Projectively Self-Concordant Barriers pp. 2444-2463

Roland Hildebrand

Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model pp. 2464-2493

Yingjie Fei and Yudong Chen

Inf-Convolution, Optimal Allocations, and Model Uncertainty for Tail Risk Measures pp. 2494-2519

Fangda Liu, Tiantian Mao, Ruodu Wang and Linxiao Wei

Algorithms for Persuasion with Limited Communication pp. 2520-2545

Ronen Gradwohl, Niklas Hahn, Martin Hoefer and Rann Smorodinsky

Volume 47, issue 2, 2022

Proportional Volume Sampling and Approximation Algorithms for A -Optimal Design pp. 847-877

Aleksandar Nikolov, Mohit Singh and Uthaipon (Tao) Tantipongpipat

Prophet Matching with General Arrivals pp. 878-898

Tomer Ezra, Michal Feldman, Nick Gravin and Zhihao Gavin Tang

Scalar Multivariate Risk Measures with a Single Eligible Asset pp. 899-922

Zachary Feinstein and Birgit Rudloff

The Pareto Frontier of Inefficiency in Mechanism Design pp. 923-944

Aris Filos-Ratsikas, Yiannis Giannakopoulos and Philip Lazos

Dynamic Fair Resource Division pp. 945-968

Shai Vardi, Alexandros Psomas and Eric Friedman

Reducing Bias in Event Time Simulations via Measure Changes pp. 969-988

Kay Giesecke and Alexander Shkolnik

Linear and Utilitarian Choice Functions: Revisiting Myerson’s Theorem pp. 989-994

Benjamin Bachi and Shiran Rachmilevitch

Coordination Games on Weighted Directed Graphs pp. 995-1025

Krzysztof R. Apt, Sunil Simon and Dominik Wojtczak

A Discrete Convex Min-Max Formula for Box-TDI Polyhedra pp. 1026-1047

András Frank and Kazuo Murota

Strong Embeddings for Transitory Queueing Models pp. 1048-1081

Prakash Chakraborty and Harsha Honnappa

Multivariate Monotone Inclusions in Saddle Form pp. 1082-1109

Minh N. Bùi and Patrick L. Combettes

Tractable Relaxations of Composite Functions pp. 1110-1140

Taotao He and Mohit Tawarmalani

Geometrically Convergent Simulation of the Extrema of Lévy Processes pp. 1141-1168

Jorge Ignacio González Cázares, Aleksandar Mijatović and Gerónimo Uribe Bravo

Directional Necessary Optimality Conditions for Bilevel Programs pp. 1169-1191

Kuang Bai and Jane J. Ye

Fluid Limits for Multiclass Many-Server Queues with General Reneging Distributions and Head-of-the-Line Scheduling pp. 1192-1228

Amber L. Puha and Amy R. Ward

A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods pp. 1229-1246

Lei Guo and Zhibin Deng

Multiplayer Bandits Without Observing Collision Information pp. 1247-1265

Gábor Lugosi and Abbas Mehrabian

Sufficiency of Markov Policies for Continuous-Time Jump Markov Decision Processes pp. 1266-1286

Eugene A. Feinberg, Manasa Mandava and Albert N. Shiryaev

Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution pp. 1287-1309

José Correa, Paul Dütting, Felix Fischer and Kevin Schewior

Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources pp. 1310-1334

Erhun Özkan

Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times pp. 1335-1364

Dennis Schol, Maria Vlasiou and Bert Zwart

The Power of Subsampling in Submodular Maximization pp. 1365-1393

Christopher Harshaw, Ehsan Kazemi, Moran Feldman and Amin Karbasi

On the Price of Anarchy for Flows over Time pp. 1394-1411

José Correa, Andrés Cristi and Tim Oosterwijk

A Dynamic Contagion Risk Model with Recovery Features pp. 1412-1442

Hamed Amini, Andreea Minca and Agnès Sulem

Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems pp. 1443-1473

Renbo Zhao

On Linear Programming for Constrained and Unconstrained Average-Cost Markov Decision Processes with Countable Action Spaces and Strictly Unbounded Costs pp. 1474-1499

Huizhen Yu

Optimal Transport-Based Distributionally Robust Optimization: Structural Properties and Iterative Schemes pp. 1500-1529

Jose Blanchet, Karthyek Murthy and Fan Zhang

A Case Study on Stochastic Games on Large Graphs in Mean Field and Sparse Regimes pp. 1530-1565

Daniel Lacker and Agathe Soret

M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System pp. 1566-1611

Akiyoshi Shioura

Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems pp. 1612-1630

Rohan Ghuge and Viswanath Nagarajan

The Folk Theorem for Repeated Games with Time-Dependent Discounting pp. 1631-1647

Daehyun Kim and Xiaoxi Li

Efficient Allocations in Double Auction Markets pp. 1648-1663

Teemu Pennanen

A Randomly Weighted Minimum Arborescence with a Random Cost Constraint pp. 1664-1680

Alan M. Frieze and Tomasz Tkocz

Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty pp. 1681-1705

Junyi Liu, Guangyu Li and Suvrajeet Sen

Volume 47, issue 1, 2022

Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps pp. 1-28

Samuel C. Gutekunst and David P. Williamson

Optimal Stopping of a Random Sequence with Unknown Distribution pp. 29-49

Alexander Goldenshluger and Assaf Zeevi

Computation of Dynamic Equilibria in Series-Parallel Networks pp. 50-71

Marcus Kaiser

Hamilton-Jacobi Equations with Semilinear Costs and State Constraints, with Applications to Large Deviations in Games pp. 72-99

William Sandholm, Hung V. Tran and Srinivas Arigapudi

Finite-Memory Strategies in POMDPs with Long-Run Average Objectives pp. 100-119

Krishnendu Chatterjee, Raimundo Saona and Bruno Ziliotto

Mean Field Analysis of Deep Neural Networks pp. 120-152

Justin Sirignano and Konstantinos Spiliopoulos

Interactive Information Design pp. 153-175

Frederic Koessler, Marie Laclau and Tristan Tomala

Decomposition of Games: Some Strategic Considerations pp. 176-208

Joseph Abdou, Nikolaos Pnevmatikos, Marco Scarsini and Xavier Venel

Graphical Convergence of Subgradients in Nonconvex Optimization and Learning pp. 209-231

Damek Davis and Dmitriy Drusvyatskiy

Large Deviations for the Single-Server Queue and the Reneging Paradox pp. 232-258

Rami Atar, Amarjit Budhiraja, Paul Dupuis and Ruoyu Wu

Polyhedral Clinching Auctions for Two-Sided Markets pp. 259-285

Hiroshi Hirai and Ryosuke Sato

Geometrical Bounds for Variance and Recentered Moments pp. 286-296

Tongseok Lim and Robert J. McCann

Intersection Disjunctions for Reverse Convex Sets pp. 297-319

Eli Towle and James Luedtke

Value Functions and Optimality Conditions for Nonconvex Variational Problems with an Infinite Horizon in Banach Spaces pp. 320-340

Hélène Frankowska and Nobusumi Sagara

Nonzero-Sum Stochastic Games and Mean-Field Games with Impulse Controls pp. 341-366

Matteo Basei, Haoyang Cao and Xin Guo

Equilibria Existence in Bayesian Games: Climbing the Countable Borel Equivalence Relation Hierarchy pp. 367-383

Ziv Hellman and Yehuda Levy

Dense Orbits of the Bayesian Updating Group Action pp. 384-396

Ziv Hellman and Yehuda Levy

Variational Analysis of Composite Models with Applications to Continuous Optimization pp. 397-426

Ashkan Mohammadi, Boris S. Mordukhovich and M. Ebrahim Sarabi

Quasi-Popular Matchings, Optimality, and Extended Formulations pp. 427-457

Yuri Faenza and Telikepalli Kavitha

Probability Distributions on Partially Ordered Sets and Network Interdiction Games pp. 458-484

Mathieu Dahan, Saurabh Amin and Patrick Jaillet

Discrete Choice Prox-Functions on the Simplex pp. 485-507

David Müller, Yurii Nesterov and Vladimir Shikhman

A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization pp. 508-539

Quoc Tran-Dinh, Ling Liang and Kim-Chuan Toh

Regular Matroids Have Polynomial Extension Complexity pp. 540-559

Manuel Aprile and Samuel Fiorini

Dynkin Games with Incomplete and Asymmetric Information pp. 560-586

Tiziano De Angelis, Erik Ekström and Kristoffer Glover

Mean-Variance Portfolio Selection with Dynamic Targets for Expected Terminal Wealth pp. 587-615

Xue Dong He and Zhaoli Jiang

Dynamic Set Values for Nonzero-Sum Games with Multiple Equilibriums pp. 616-642

Zachary Feinstein, Birgit Rudloff and Jianfeng Zhang

Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses pp. 643-664

Yiannis Giannakopoulos, Georgy Noarov and Andreas S. Schulz

Infinite Horizon Stochastic Impulse Control with Delay and Random Coefficients pp. 665-689

Boualem Djehiche, Said Hamadène, Ibtissem Hdhiri and Helmi Zaatra

A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization pp. 690-719

Afrooz Jalilzadeh, Angelia Nedić, Uday V. Shanbhag and Farzad Yousefian

Mixed-Integer Convex Representability pp. 720-749

Miles Lubin, Juan Pablo Vielma and Ilias Zadik

Stochastic Graphon Games: I. The Static Case pp. 750-778

René Carmona, Daniel B. Cooney, Christy V. Graves and Mathieu Laurière

Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization pp. 779-811

Riley Badenbroek and Etienne de Klerk

Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs pp. 812-846

Max Klimm and Philipp Warode