Research Article

On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems

Pages:209–227

Published Online:November 28, 2012

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

Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics

Pages:228–247

Published Online:January 18, 2013

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

Lifts of Convex Sets and Cone Factorizations

Pages:248–264

Published Online:January 18, 2013

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

Entropy Coherent and Entropy Convex Measures of Risk

Pages:265–293

Published Online:October 24, 2012

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

A Fluid Limit for an Overloaded X Model via a Stochastic Averaging Principle

Pages:294–349

Published Online:December 20, 2012

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

Lipschitz Games

Pages:350–357

Published Online:October 24, 2012

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

Zero-Variance Importance Sampling Estimators for Markov Process Expectations

Pages:358–388

Published Online:November 28, 2012

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

A Note on Roth's Consensus Property of Many-to-One Matching

Pages:389–392

Published Online:January 18, 2013

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

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.