Research Articles

Stationary Waiting Time in Parallel Queues with Synchronization

Pages:1–27

Published Online:September 18, 2020

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

A Dynkin Game on Assets with Incomplete Information on the Return

Pages:28–60

Published Online:September 17, 2020

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

Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions

Pages:61–81

Published Online:June 25, 2019

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

Resistant Sets in the Unit Hypercube

Pages:82–114

Published Online:October 14, 2020

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

Stochastic Load Balancing on Unrelated Machines

Pages:115–133

Published Online:August 24, 2020

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

Efficient Black-Box Reductions for Separable Cost Sharing

Pages:134–158

Published Online:August 25, 2020

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

Game of Thrones: Fully Distributed Learning for Multiplayer Bandits

Pages:159–178

Published Online:October 26, 2020

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

Online Learning over a Finite Action Set with Limited Switching

Pages:179–203

Published Online:September 17, 2020

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

Efficient Online Linear Optimization with Approximation Algorithms

Pages:204–220

Published Online:October 13, 2020

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

Fast Hybrid Schemes for Fractional Riccati Equations (Rough Is Not So Tough)

Pages:221–254

Published Online:November 6, 2020

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

New Algorithms for Solving Zero-Sum Stochastic Games

Pages:255–267

Published Online:May 28, 2020

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

Heavy Traffic Limits for Join-the-Shortest-Estimated-Queue Policy Using Delayed Information

Pages:268–300

Published Online:June 15, 2020

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

Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization

Pages:301–316

Published Online:September 15, 2020

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

Algorithms as Mechanisms: The Price of Anarchy of Relax and Round

Pages:317–335

Published Online:October 14, 2020

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

Infinite-Horizon Optimal Switching Regions for a Pair-Trading Strategy with Quadratic Risk Aversion Considering Simultaneous Multiple Switchings: A Viscosity Solution Approach

Pages:336–360

Published Online:October 5, 2020

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

Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization

Pages:361–381

Published Online:October 9, 2020

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

Competitive Equilibrium with Indivisible Goods and Generic Budgets

Pages:382–403

Published Online:January 27, 2021

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

Editorial Board

Free Access
Editorial Board

Pages:C2–C2

Published Online:February 5, 2021

https://doi.org/10.1287/moor.2021.eb.v46n1

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.