In This Issue

Contextual Areas

Robust Risk Quantification via Shock Propagation in Financial Networks

Pages:1–18

Published Online:September 1, 2023

https://doi.org/10.1287/opre.2020.0722

Demand Estimation Under Uncertain Consideration Sets

Pages:19–42

Published Online:September 4, 2023

https://doi.org/10.1287/opre.2022.0006

Dynamic Development Contests

Pages:43–59

Published Online:September 21, 2023

https://doi.org/10.1287/opre.2021.0420

A Sequential Model for High-Volume Recruitment Under Random Yields

Pages:60–90

Published Online:September 26, 2023

https://doi.org/10.1287/opre.2021.0562

Provably Good Region Partitioning for On-Time Last-Mile Delivery

Pages:91–109

Published Online:October 5, 2023

https://doi.org/10.1287/opre.2021.0588

Systemic Portfolio Diversification

Pages:110–131

Published Online:October 9, 2023

https://doi.org/10.1287/opre.2022.0290

Technical Note—Cloud Cost Optimization: Model, Bounds, and Asymptotics

Pages:132–150

Published Online:November 2, 2023

https://doi.org/10.1287/opre.2022.0362

Crosscutting Areas

Persuading Risk-Conscious Agents: A Geometric Approach

Pages:151–166

Published Online:March 28, 2023

https://doi.org/10.1287/opre.2023.2438

Resource-Aware Cost-Sharing Methods for Scheduling Games

Pages:167–184

Published Online:April 12, 2023

https://doi.org/10.1287/opre.2023.2434

A Planner-Trader Decomposition for Multimarket Hydro Scheduling

Pages:185–202

Published Online:April 18, 2023

https://doi.org/10.1287/opre.2023.2456

Open Access
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model

Pages:203–221

Published Online:April 21, 2023

https://doi.org/10.1287/opre.2023.2451

Open Access
Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis

Pages:222–236

Published Online:April 21, 2023

https://doi.org/10.1287/opre.2023.2450

Recursive Importance Sketching for Rank Constrained Least Squares: Algorithms and High-Order Convergence

Pages:237–256

Published Online:May 2, 2023

https://doi.org/10.1287/opre.2023.2445

Estimating Large-Scale Tree Logit Models

Pages:257–276

Published Online:May 16, 2023

https://doi.org/10.1287/opre.2023.2479

Technical Note—A Note on State-Independent Policies in Network Revenue Management

Pages:277–287

Published Online:May 16, 2023

https://doi.org/10.1287/opre.2023.2471

Technical Note—Incomplete Information VCG Contracts for Common Agency

Pages:288–299

Published Online:July 18, 2023

https://doi.org/10.1287/opre.2023.2475

Methods

Sequential Competitive Facility Location: Exact and Approximate Algorithms

Pages:300–316

Published Online:August 5, 2022

https://doi.org/10.1287/opre.2022.2339

Dynamic Interday and Intraday Scheduling

Pages:317–335

Published Online:August 24, 2022

https://doi.org/10.1287/opre.2022.2342

Parallel Adaptive Survivor Selection

Pages:336–354

Published Online:August 24, 2022

https://doi.org/10.1287/opre.2022.2343

Mechanism Design Under Approximate Incentive Compatibility

Pages:355–372

Published Online:August 24, 2022

https://doi.org/10.1287/opre.2022.2359

An Approximate Dynamic Programming Approach to Repeated Games with Vector Losses

Pages:373–388

Published Online:August 29, 2022

https://doi.org/10.1287/opre.2022.2334

Open Access
Identifying Merger Opportunities: The Case of Air Traffic Control

Pages:389–409

Published Online:September 8, 2022

https://doi.org/10.1287/opre.2022.2348

Technical Note—Data-Driven Chance Constrained Programs over Wasserstein Balls

Pages:410–424

Published Online:July 21, 2022

https://doi.org/10.1287/opre.2022.2330

Editorial Board

Free Access
Editorial Board

Pages:C2–C3

Published Online:February 6, 2024

https://doi.org/10.1287/opre.2024.eb.v7201

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.