Note on lexicographic-order preservation and stochastic dominance
β Scribed by Irving H. Lavalle; Peter C. Fishburn
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 70 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1057-9214
No coin nor oath required. For personal study only.
β¦ Synopsis
This note concerns two issues left unresolved in our study of lexicographic-order preservation and stochastic dominance in settings where preferences are represented by utility vectors, ordered lexicographically, and judgements emerge as matrices that premultiply utility vectors in expected utility sums. First, a generalization of the 'Conjecture S', which implied transitivity of a stochastic dominance relation under non-vacuous resolutionlevel information, is proved. Second, this paper comments on using resolution-level information in higher as well as in first degree stochastic dominance analysis.
π SIMILAR VOLUMES
A Roman dominating function of a graph G is a function f : V β {0, 1, 2} such that every vertex with 0 has a neighbor with 2. The minimum of f (V (G)) = vβV f (v) over all such functions is called the Roman domination number Ξ³ R (G). A 2-rainbow dominating function of a graph G is a function g that