8 New Models of Dominance of Allocations (in Network Games) That Solve Some of the Problems Inherent in Lorenz Dominance, Higher-Order Stochastic Dominance Models and Higher-Order Prospect Theory

2017 ◽  
Vol 19 (3) ◽  
pp. 245-253 ◽  
Author(s):  
Cuizhen Niu ◽  
Wing-Keung Wong ◽  
Qunfang Xu

2014 ◽  
Vol 48 (1) ◽  
pp. 103-107
Author(s):  
Cuizhen Niu ◽  
Xu Guo

2009 ◽  
Vol 1 (1) ◽  
pp. 34-59
Author(s):  
Russell Davidson

Extensions are presented to the results of Davidson and Duclos (2007), whereby the null hypothesis of restricted stochastic non dominance can be tested by both asymptotic and bootstrap tests, the latter having considerably better properties as regards both size and power. In this paper, the methodology is extended to tests of higher-order stochastic dominance. It is seen that, unlike the first-order case, a numerical nonlinear optimisation problem has to be solved in order to construct the bootstrap DGP. Conditions are provided for a solution to exist for this problem, and efficient numerical algorithms are laid out. The empirically important case in which the samples to be compared are correlated is also treated, both for first-order and for higher-order dominance. For all of these extensions, the bootstrap algorithm is presented. Simulation experiments show that the bootstrap tests perform considerably better than asymptotic tests, and yield reliable inference in moderately sized samples.


2011 ◽  
Vol 18 (01) ◽  
pp. 71-85
Author(s):  
Fabrizio Cacciafesta

We provide a simple way to visualize the variance and the mean absolute error of a random variable with finite mean. Some application to options theory and to second order stochastic dominance is given: we show, among other, that the "call-put parity" may be seen as a Taylor formula.


Sign in / Sign up

Export Citation Format

Share Document