First order stochastic dominance
Key idea
Higher expected value from the dominant distribution
Details
We say F(x) F.O.S.D G(x) if F(x)≤G(x),∀x
Higher expected value (1)
Suppose the support of the distribution is some interval [α,β]
∫αβxf(x)dx=∫αβxdF(x)=[xF(x)]αβ−∫αβF(x)dx
As F(x)≤G(x)∀x, then ∫αβF(x)dx≤∫αβG(x)dx, minus a smaller quantity in turn implies that E(F(x))≥E(G(x)).
Higher expected value (2)
Consider some non-decreasing function u(x):
∫αβu(x)[f(x)−g(x)]dx=∫αβu(x)d[F(x)−G(x)]
Using integration by parts again, this equals to:
[u(x)[F(x)−G(x)]]αβ−∫αβ[F(x)−G(x)]u′(x)dx=−∫αβ[F(x)−G(x)]u′(x)dx
Again as F(x)≤G(x)∀x and u′(x)≥0, then we have:
EF(x)(u(x))≥EG(x)(u(x))
Conditional stochastic dominance
Key idea
Truncate from right, left-tail probability mass higher
Details
Consider two differentiable distribution functions F(θ) and G(θ) with common support [α,β].
Define Fy(θ) and Gy(θ) to be the two distribution functions right truncated at point y. That is,
Fy(θ)=F(y)F(θ);∀θ∈[α,y]
Gy(θ)=G(y)G(θ);∀θ∈[α,y]
Then we say F(.) conditionally stochastic dominate G(.) if
Fy(θ)=F(y)F(θ)<G(y)G(θ)=Gy(θ),∀y∈[α,β];∀θ<y
In words, we say F(.) conditionally stochastic dominate G(.) if for every right truncation y, the resultant probability mass in the left-tail is less in F(.) than in G(.).
Useful links
Conditional stochastic dominance: http://www.econ.ucla.edu/riley/201C/2017/MathematicalNote.pdf