This paper develops some new stochastic dominance (SD) rules for ranking transformations on a random variable, which is the first time to study ranking approach for transformations on the discrete framework. By using the expected utility theory, the authors first present a sufficient condition...

This paper presents some new stochastic dominance (SD) criteria for ranking transformations on a random variable, which is the first time that this is done for transformations under the discrete framework. By using the expected utility theory, the authors first propose a sufficient condition for...

A counterexample is presented to show that the sufficient condition for one transformation dominating another by the second degree stochastic dominance, proposed by Theorem 5 of Levy (Stochastic dominance and expected utility: Survey and analysis, 1992), does not hold. Then, by restricting the...

Almost stochastic dominance is a relaxation of stochastic dominance, which allows small violations of stochastic dominance rules to avoid situations where most decision makers prefer one alternative to another but stochastic dominance cannot rank them. The authors first discuss the relations...

A counterexample is presented to show that the sufficient condition for one transformation dominating another by the second degree stochastic dominance, proposed by Theorem 5 of Levy (Stochastic dominance and expected utility: Survey and analysis, 1992), does not hold. Then, by restricting the...