Research Articles

Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design

Pages:847–877

Published Online:February 15, 2022

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

Prophet Matching with General Arrivals

Pages:878–898

Published Online:December 7, 2021

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

Scalar Multivariate Risk Measures with a Single Eligible Asset

Pages:899–922

Published Online:September 16, 2021

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

The Pareto Frontier of Inefficiency in Mechanism Design

Pages:923–944

Published Online:November 10, 2021

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

Dynamic Fair Resource Division

Pages:945–968

Published Online:September 27, 2021

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

Reducing Bias in Event Time Simulations via Measure Changes

Pages:969–988

Published Online:February 2, 2022

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

Linear and Utilitarian Choice Functions: Revisiting Myerson’s Theorem

Pages:989–994

Published Online:May 17, 2021

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

Coordination Games on Weighted Directed Graphs

Pages:995–1025

Published Online:October 4, 2021

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

A Discrete Convex Min-Max Formula for Box-TDI Polyhedra

Pages:1026–1047

Published Online:October 18, 2021

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

Strong Embeddings for Transitory Queueing Models

Pages:1048–1081

Published Online:November 11, 2021

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

Multivariate Monotone Inclusions in Saddle Form

Pages:1082–1109

Published Online:December 21, 2021

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

Tractable Relaxations of Composite Functions

Pages:1110–1140

Published Online:October 1, 2021

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

Geometrically Convergent Simulation of the Extrema of Lévy Processes

Pages:1141–1168

Published Online:November 24, 2021

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

Directional Necessary Optimality Conditions for Bilevel Programs

Pages:1169–1191

Published Online:October 25, 2021

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

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

Pages:1192–1228

Published Online:December 21, 2021

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

A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods

Pages:1229–1246

Published Online:October 4, 2021

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

Multiplayer Bandits Without Observing Collision Information

Pages:1247–1265

Published Online:November 11, 2021

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

Sufficiency of Markov Policies for Continuous-Time Jump Markov Decision Processes

Pages:1266–1286

Published Online:October 19, 2021

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

Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution

Pages:1287–1309

Published Online:December 20, 2021

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

Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources

Pages:1310–1334

Published Online:October 28, 2021

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

Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times

Pages:1335–1364

Published Online:December 14, 2021

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

The Power of Subsampling in Submodular Maximization

Pages:1365–1393

Published Online:October 13, 2021

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

On the Price of Anarchy for Flows over Time

Pages:1394–1411

Published Online:December 22, 2021

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

A Dynamic Contagion Risk Model with Recovery Features

Pages:1412–1442

Published Online:November 24, 2021

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

Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems

Pages:1443–1473

Published Online:December 23, 2021

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

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

Pages:1474–1499

Published Online:December 15, 2021

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

Optimal Transport-Based Distributionally Robust Optimization: Structural Properties and Iterative Schemes

Pages:1500–1529

Published Online:November 10, 2021

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

A Case Study on Stochastic Games on Large Graphs in Mean Field and Sparse Regimes

Pages:1530–1565

Published Online:October 25, 2021

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

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

Pages:1566–1611

Published Online:December 16, 2021

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

Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems

Pages:1612–1630

Published Online:November 23, 2021

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

The Folk Theorem for Repeated Games with Time-Dependent Discounting

Pages:1631–1647

Published Online:October 21, 2021

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

Efficient Allocations in Double Auction Markets

Pages:1648–1663

Published Online:November 5, 2021

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

A Randomly Weighted Minimum Arborescence with a Random Cost Constraint

Pages:1664–1680

Published Online:November 23, 2021

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

Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty

Pages:1681–1705

Published Online:November 10, 2021

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

Editorial Board

Free Access
Editorial Board

Pages:C2–C2

Published Online:May 24, 2022

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

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.