Research Articles

Strategy-Proofness Makes the Difference: Deferred-Acceptance with Responsive Priorities

Pages:949–966

Published Online:July 14, 2014

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

Partial Monitoring—Classification, Regret Bounds, and Algorithms

Pages:967–997

Published Online:June 27, 2014

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

Approximating Sparse Covering Integer Programs Online

Pages:998–1011

Published Online:May 30, 2014

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

Optimal Design for Multi-Item Auctions: A Robust Optimization Approach

Pages:1012–1038

Published Online:April 15, 2014

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

Approximation Algorithm for the Stochastic Multiperiod Inventory Problem via a Look-Ahead Optimization Approach

Pages:1039–1056

Published Online:January 20, 2014

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

Opportunistic Approachability and Generalized No-Regret Problems

Pages:1057–1083

Published Online:April 16, 2014

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

Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems

Pages:1084–1108

Published Online:April 2, 2014

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

Robust Portfolio Choice and Indifference Valuation

Pages:1109–1141

Published Online:July 14, 2014

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

Rare-Event Simulation for Many-Server Queues

Pages:1142–1178

Published Online:July 2, 2014

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

Approximation Balancing Policies for Inventory Systems with Remanufacturing

Pages:1179–1197

Published Online:April 16, 2014

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

An Explicit Solution of a Nonlinear-Quadratic Constrained Stochastic Control Problem with Jumps: Optimal Liquidation in Dark Pools with Adverse Selection

Pages:1198–1220

Published Online:April 14, 2014

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

Learning to Optimize via Posterior Sampling

Pages:1221–1243

Published Online:April 23, 2014

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

A Note on Appointment Scheduling with Piecewise Linear Cost Functions

Pages:1244–1251

Published Online:November 13, 2013

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

Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games

Pages:1252–1296

Published Online:May 27, 2014

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

A Tight 2-Approximation for Preemptive Stochastic Scheduling

Pages:1297–1310

Published Online:May 30, 2014

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

Polynomially Computable Bounds for the Probability of the Union of Events

Pages:1311–1329

Published Online:June 20, 2014

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

Tight Lower Bounds on the Sizes of Symmetric Extensions of Permutahedra and Similar Results

Pages:1330–1339

Published Online:July 16, 2014

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

The Hirsch Conjecture Holds for Normal Flag Complexes

Pages:1340–1348

Published Online:June 26, 2014

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

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.