✦ LIBER ✦

A note on comparative statics and stochastic dominance

✍ Scribed by Ian Jewitt

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 286 KB
Volume: 15
Category: Article
ISSN: 0304-4068
DOI: 10.1016/0304-4068(86)90013-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note on lexicographic-order preservation

Note on lexicographic-order preservation and stochastic dominance

✍ Irving H. Lavalle; Peter C. Fishburn 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 70 KB

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

A note on the dominance hierarchy index

✍ Max D. Morris; C. Alex McMahan 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 253 KB

The realized (observed) value of Landau's dominance hierarchy index is examined. Under a model of constant pairwise dominance probabilities, the observed index is shown to be a strongly consistent estimator of the underlying (true) index. However, a large number of encounters between animals is show

A Note on Comparing Stochastically Restr

A Note on Comparing Stochastically Restricted Linear Estimators in a Regression Model

✍ Prof. Dr. Götz Trenkler 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

A note on total domination

✍ Robert B Allan; Renu Laskar; Stephen Hedetniemi 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 278 KB

For a graph G, let ~'(G), 3,z(G), i(G) and ir(G) denote the domination, total domination, independent domination and irredundance numbers of G, respectively. The following conjectures due to Robyn Dawes are proved: G)<~p and (ii) i(G)+ ~/z(G)~2. It is also shown that (iii) 3,t(G) ~<2ir(G) and (iv) 3

A Note on Spectrally Dominant Norms

✍ Angel Rodriguez Palacios 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 78 KB

A note on distance-dominating cycles

✍ P. Fraisse 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 396 KB

Nous prouvons une conjecture due & Bondy et Fan. Un cycle C d'un graphe G est dit m-dominant si tout sommet de V(G -C) est a distance au plus m de C. Notre r&t&at est: si G est k-connexe, et si G n'a pas de cycle m-dominant, alors il existe un stable de cardinal k + 1, dont les sommets sont deux 3 d