In This Issue

Contextual Areas

Preservation of Supermodularity in Parametric Optimization: Necessary and Sufficient Conditions on Constraint Structures

Pages:1–12

Published Online:December 15, 2020

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

Technical Note—Understanding the Performance of Capped Base-Stock Policies in Lost-Sales Inventory Models

Pages:61–70

Published Online:December 17, 2020

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

Targeting, Deployment, and Loss-Tolerance in Lanchester Engagements

Pages:71–81

Published Online:December 9, 2020

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

Risk Arbitrage Opportunities for Stock Index Options

Pages:100–113

Published Online:December 17, 2020

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

Crosscutting Areas

Competitive Equilibrium and Trading Networks: A Network Flow Approach

Pages:114–147

Published Online:December 28, 2020

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

Value of Information in Bayesian Routing Games

Pages:148–163

Published Online:December 11, 2020

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

Technical Note—Global Robust Stability in a General Price and Assortment Competition Model

Pages:164–174

Published Online:December 16, 2020

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

Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy

Pages:175–187

Published Online:December 15, 2020

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

A Simple and Approximately Optimal Mechanism for a Buyer with Complements

Pages:188–206

Published Online:December 15, 2020

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

Tractable Equilibria in Sponsored Search with Endogenous Budgets

Pages:227–244

Published Online:December 24, 2020

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

Methods

Technical Note—A Stochastic Assignment Problem with Unknown Eligibility Probabilities

Pages:266–272

Published Online:October 15, 2020

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

Technical Note—A Note on the Equivalence of Upper Confidence Bounds and Gittins Indices for Patient Agents

Pages:273–278

Published Online:December 24, 2020

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

The Discrete Moment Problem with Nonconvex Shape Constraints

Pages:279–296

Published Online:October 26, 2020

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

Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions

Pages:297–314

Published Online:October 14, 2020

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

Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach

Pages:315–330

Published Online:September 15, 2020

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

Nonsparse Learning with Latent Variables

Pages:346–359

Published Online:December 23, 2020

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

Editorial Board

Free Access
Editorial Board

Pages:C2–C3

Published Online:February 1, 2021

https://doi.org/10.1287/opre.2021.eb.v6901

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.