Issue in understanding stochastic ordering

  • Thread starter Thread starter pakkanen
  • Start date Start date
  • Tags Tags
    Stochastic
pakkanen
Messages
11
Reaction score
0
This is not actually a problem but I need clarification for stochastic ordering

From Wikipedia, there is stated: (http://en.wikipedia.org/wiki/Stochastic_ordering)

Usual stochastic order:
a real random variable A is less than a random variable B in the "usual stochastic order" if
Pr(A>x) ≤ Pr(B>x) ,where Pr(°) denotes the probability of an event.

Here comes the issue that I do not understand:
Characterizations:
The following rules describe cases when one random variable is stochastically less than or equal to another. Strict version of some of these rules also exist.

1. A ≤ B if and only if for all non-decreasing functions u, E[u(A)] ≤ E[u(B)].

Why it is not possible to attain Pr(A>x) ≥ Pr(B>x) for some x even if E[u(A)] ≤ E[u(B)] ?
 
Physics news on Phys.org
pakkanen said:
This is not actually a problem but I need clarification for stochastic ordering

From Wikipedia, there is stated: (http://en.wikipedia.org/wiki/Stochastic_ordering)

Usual stochastic order:
a real random variable A is less than a random variable B in the "usual stochastic order" if
Pr(A>x) ≤ Pr(B>x) ,where Pr(°) denotes the probability of an event.

Here comes the issue that I do not understand:
Characterizations:
The following rules describe cases when one random variable is stochastically less than or equal to another. Strict version of some of these rules also exist.

1. A ≤ B if and only if for all non-decreasing functions u, E[u(A)] ≤ E[u(B)].

Why it is not possible to attain Pr(A>x) ≥ Pr(B>x) for some x even if E[u(A)] ≤ E[u(B)] ?


The inequality E[u(A)] ≤ E[u(B)] is assumed to hold for ALL non-decreasing functions. For the special case where u(t) = 0 if t ≤ x and u(t) = 1 if t > x (a non-decreasing function) we have E[u(A)] = Pr(A>x), etc.

Note: we can assume the seemingly-weaker hypothesis that E[u(A)] ≤ E[u(B)] holds for all strictly increasing u; then, by a limiting argument we can prove it for all non-decreasing u. Therefore, the special u above is in no sense "artificial".

RGV
 
Late gratitudes! I believe I get it.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top