Introduction to the Applied Probability Society’s “Open Problems in Applied Probability” Session at the INFORMS Annual Meeting, Phoenix, Arizona, November 4–7, 2018

Published Online:https://doi.org/10.1287/stsy.2019.0039

References

  • Arapostathis A (2019) Convergence and asymptotic optimality of relative value iteration in ergodic control. Stochastic Systems 9(3):292–294.AbstractGoogle Scholar
  • Down DG (2019) Size-based scheduling with estimation errors. Stochastic Systems 9(3):295–296.AbstractGoogle Scholar
  • Grosof I (2019) M/G/k/SRPT under medium load. Stochastic Systems 9(3):297–298.AbstractGoogle Scholar
  • Jalilzadeh A, Lei J, Shanbhag UV (2019) Iterative schemes for stochastic optimization: convergence statements and limit theorems. Stochastic Systems 9(3):299–302.AbstractGoogle Scholar
  • Kruk Ł (2019) Protocols for resource-sharing networks with locally edge minimal fluid models. Stochastic Systems 9(3):303–304.AbstractGoogle Scholar
  • Lipshutz D (2019) Load balancing using delayed information. Stochastic Systems 9(3):305–306.AbstractGoogle Scholar
  • Pasupathy R, Honnappa H, Hunter SR (2019) Adaptive constant-step stochastic approximation. Stochastic Systems 9(3):307–310.AbstractGoogle Scholar
  • Scully Z (2019) M/G/1 scheduling with preemption delays. Stochastic Systems 9(3):311–312.AbstractGoogle Scholar
  • Ward A (2019) Regarding static priority scheduling for many-server queues with reneging. Stochastic Systems 9(3):313–314.AbstractGoogle Scholar
  • Wu R (2019) Weakly interacting particle systems on dense random graphs. Stochastic Systems 9(3):315–317.AbstractGoogle Scholar
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.