Stochastic ordering conjecture for needy patients in Erlang-R and closed ward models

Let Q1b()Q_1^b(\infty), Q1h()Q_1^h(\infty) and Q1c()Q_1^c(\infty) denote the stationary numbers of needy patients in the Erlang-R models with blocking and holding and in the closed ward model, respectively. For random variables, write XstYX\preceq_{\rm st}Y when XX is stochastically dominated by YY. Stochastic ordering conjecture.

Q1b()stQ1h()stQ1c().Q_1^b(\infty)\preceq_{\rm st}Q_1^h(\infty)\preceq_{\rm st}Q_1^c(\infty).

The ordering is motivated by simulation results under the scaling considered in the paper and was observed across a multitude of parameter settings for (β,γ)(\beta,\gamma). It compares the stationary needy-patient populations of the blocking, holding and closed ward models; no proof or resolution is supplied here.

Sources & referencesView supporting material

Primary source

Johan S. H. van Leeuwaarden, Britt W. J. Mathijsen, Fiona Sloothaak and Galit B. Yom-Tov, “The restricted Erlang-R Queue: Finite-size effects in service systems with returning customers”, arXiv:1612.07088 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.