Research Articles

Exit Game with Private Information

Pages:2433–2469

Published Online:September 12, 2024

https://doi.org/10.1287/moor.2022.0285

Online Estimation and Optimization of Utility-Based Shortfall Risk

Pages:2470–2501

Published Online:September 16, 2024

https://doi.org/10.1287/moor.2022.0266

Value-Positivity for Matrix Games

Pages:2502–2525

Published Online:October 1, 2024

https://doi.org/10.1287/moor.2022.0332

Stochastic Control Problems with State Reflections Arising from Relaxed Benchmark Tracking

Pages:2526–2551

Published Online:October 1, 2024

https://doi.org/10.1287/moor.2023.0265

On Average Optimality for Non-Stationary Markov Decision Processes in Borel Spaces

Pages:2552–2576

Published Online:October 7, 2024

https://doi.org/10.1287/moor.2023.0169

Primal-Dual Extrapolation Methods for Monotone Inclusions Under Local Lipschitz Continuity

Pages:2577–2599

Published Online:October 9, 2024

https://doi.org/10.1287/moor.2024.0407

A Dynamic Principal-Agent Problem with One-Sided Commitment

Pages:2600–2632

Published Online:October 9, 2024

https://doi.org/10.1287/moor.2022.0223

Fast Convex Optimization via Time Scale and Averaging of the Steepest Descent

Pages:2633–2665

Published Online:October 16, 2024

https://doi.org/10.1287/moor.2023.0186

Relaxed Equilibria for Time-Inconsistent Markov Decision Processes

Pages:2666–2687

Published Online:October 23, 2024

https://doi.org/10.1287/moor.2023.0209

A 0/1 Constrained Optimization Solving Sample Average Approximation for Chance Constrained Programming

Pages:2688–2716

Published Online:October 29, 2024

https://doi.org/10.1287/moor.2023.0149

Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria

Pages:2717–2737

Published Online:November 1, 2024

https://doi.org/10.1287/moor.2023.0244

Is Pessimism Provably Efficient for Offline Reinforcement Learning?

Pages:2738–2793

Published Online:November 6, 2024

https://doi.org/10.1287/moor.2022.0216

On the Impossibility of Convergence of Mixed Strategies with Optimal No-Regret Learning

Pages:2794–2833

Published Online:November 6, 2024

https://doi.org/10.1287/moor.2022.0016

Dynamic Resource Allocation: The Geometry and Robustness of Constant Regret

Pages:2834–2872

Published Online:November 11, 2024

https://doi.org/10.1287/moor.2020.0334

A Squared Smoothing Newton Method for Semidefinite Programming

Pages:2873–2908

Published Online:November 12, 2024

https://doi.org/10.1287/moor.2023.0311

Improved Guarantees for the A Priori TSP

Pages:2909–2940

Published Online:November 20, 2024

https://doi.org/10.1287/moor.2023.0322

Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal

Pages:2941–2971

Published Online:November 20, 2024

https://doi.org/10.1287/moor.2023.0208

Deep Quadratic Hedging

Pages:2972–3009

Published Online:November 21, 2024

https://doi.org/10.1287/moor.2023.0213

An Equivalent Reformulation and Multiproximity Gradient Algorithms for a Class of Nonsmooth Fractional Programming

Pages:3010–3038

Published Online:November 22, 2024

https://doi.org/10.1287/moor.2024.0457

Tight Bounds for Secretary Matching in General Graphs

Pages:3039–3054

Published Online:November 26, 2024

https://doi.org/10.1287/moor.2022.0206

A Machine Learning Method for Stackelberg Mean Field Games

Pages:3055–3093

Published Online:December 2, 2024

https://doi.org/10.1287/moor.2023.0065

p-Sphere Covering and Approximating Nuclear p-Norm

Pages:3094–3124

Published Online:December 9, 2024

https://doi.org/10.1287/moor.2023.0216

Stochastic First-Order Methods for Average-Reward Markov Decision Processes

Pages:3125–3160

Published Online:December 9, 2024

https://doi.org/10.1287/moor.2022.0241

Pandora’s Problem with Combinatorial Cost

Pages:3161–3189

Published Online:December 18, 2024

https://doi.org/10.1287/moor.2023.0248

An Stochastic Differential Equation Perspective on Stochastic Convex Optimization

Pages:3190–3221

Published Online:December 20, 2024

https://doi.org/10.1287/moor.2022.0162

A Riemannian Alternating Direction Method of Multipliers

Pages:3222–3242

Published Online:December 20, 2024

https://doi.org/10.1287/moor.2023.0068

Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes

Pages:3243–3256

Published Online:December 24, 2024

https://doi.org/10.1287/moor.2022.0256

On Interim Envy-Free Allocation Lotteries

Pages:3257–3282

Published Online:January 10, 2025

https://doi.org/10.1287/moor.2023.0203

Editorial Board

Free Access
Editorial Board

Pages:iii–iii

Published Online:November 19, 2025

https://doi.org/10.1287/moor.2025.eb.v50n4

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.