Research Articles

A Stochastic Representation for Nonlocal Parabolic PDEs with Applications

Pages:1707–1730

Published Online:February 3, 2022

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

The Buck-Passing Game

Pages:1731–1756

Published Online:November 8, 2021

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

Distributionally Robust Markov Decision Processes and Their Connection to Risk Measures

Pages:1757–1780

Published Online:November 23, 2021

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

Equilibria and Systemic Risk in Saturated Networks

Pages:1781–1801

Published Online:October 19, 2021

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

Optimal Retirement Under Partial Information

Pages:1802–1832

Published Online:November 30, 2021

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

A Class of Recursive Optimal Stopping Problems with Applications to Stock Trading

Pages:1833–1861

Published Online:December 21, 2021

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

Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems

Pages:1862–1874

Published Online:November 9, 2021

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

Fair Cake Division Under Monotone Likelihood Ratios

Pages:1875–1903

Published Online:December 16, 2021

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

Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability

Pages:1904–1931

Published Online:December 9, 2021

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

Sparse Solutions of a Class of Constrained Optimization Problems

Pages:1932–1956

Published Online:December 3, 2021

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

Consumption Smoothing and Discounting in Infinite-Horizon, Discrete-Choice Problems

Pages:1957–1969

Published Online:December 9, 2021

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

Fully Polynomial-Time Approximation Schemes for Fair Rent Division

Pages:1970–1998

Published Online:December 9, 2021

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

Impact of Network Structure on New Service Pricing

Pages:1999–2033

Published Online:December 10, 2021

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

Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization

Pages:2034–2064

Published Online:November 10, 2021

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

Parametric Shortest-Path Algorithms via Tropical Geometry

Pages:2065–2081

Published Online:February 17, 2022

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

Distributed Stochastic Optimization with Large Delays

Pages:2082–2111

Published Online:December 1, 2021

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

Optimal Electricity Demand Response Contracting with Responsiveness Incentives

Pages:2112–2137

Published Online:February 17, 2022

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

Analyzing Approximate Value Iteration Algorithms

Pages:2138–2159

Published Online:December 30, 2021

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

On Optimality Conditions for Nonlinear Conic Programming

Pages:2160–2185

Published Online:December 9, 2021

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

Small-Loss Bounds for Online Learning with Partial Information

Pages:2186–2218

Published Online:January 25, 2022

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

On Degenerate Doubly Nonnegative Projection Problems

Pages:2219–2239

Published Online:December 16, 2021

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

Correlated Equilibria and Mean Field Games: A Simple Model

Pages:2240–2259

Published Online:February 10, 2022

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

Penalty and Augmented Lagrangian Methods for Constrained DC Programming

Pages:2260–2285

Published Online:January 7, 2022

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

Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online

Pages:2286–2309

Published Online:January 19, 2022

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

Asymptotically Optimal Sequential Design for Rank Aggregation

Pages:2310–2332

Published Online:January 5, 2022

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

A Result on Convergence of Sequences of Iterations with Applications to Best-Response Dynamics

Pages:2333–2343

Published Online:December 28, 2021

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

Second-Order Optimality Conditions for Nonconvex Set-Constrained Optimization Problems

Pages:2344–2365

Published Online:January 13, 2022

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

One-Step Estimation with Scaled Proximal Methods

Pages:2366–2386

Published Online:December 13, 2021

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

Distributionally Robust Inventory Control When Demand Is a Martingale

Pages:2387–2414

Published Online:January 26, 2022

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

Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs

Pages:2415–2443

Published Online:December 7, 2021

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

Projectively Self-Concordant Barriers

Pages:2444–2463

Published Online:January 25, 2022

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

Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model

Pages:2464–2493

Published Online:March 29, 2022

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

Inf-Convolution, Optimal Allocations, and Model Uncertainty for Tail Risk Measures

Pages:2494–2519

Published Online:February 3, 2022

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

Algorithms for Persuasion with Limited Communication

Pages:2520–2545

Published Online:February 4, 2022

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

Editorial Board

Free Access
Editorial Board

Pages:C2–C2

Published Online:September 15, 2022

https://doi.org/10.1287/moor.2022.eb.v47n3

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.