Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Armand M. Makowski (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: