On an elementary characterization of the increasing convex ordering, by an application
- 1 September 1994
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 31 (3) , 834-840
- https://doi.org/10.2307/3215161
Abstract
In this short note, we present a simple characterization of the increasing convex ordering on the set of probability distributions on ℝ. We show its usefulness by providing a very short proof of a comparison result for M/GI/1 queues due to Daley and Rolski, and obtained by completely different means.Keywords
This publication has 6 references indexed in Scilit:
- Queueing models for systems with synchronization constraintsProceedings of the IEEE, 1989
- Some comparability results for waiting times in single- and many-server queuesJournal of Applied Probability, 1984
- Ordering of Distributions and Rearrangement of FunctionsThe Annals of Probability, 1981
- Technical Note—On the Comparison of Waiting Times in GI/G/1 QueuesOperations Research, 1976
- The Existence of Probability Measures with Given MarginalsThe Annals of Mathematical Statistics, 1965
- On the Characteristics of the General Queueing Process, with Applications to Random WalkThe Annals of Mathematical Statistics, 1956