✦ LIBER ✦

Preferences and normal goods: A sufficient condition

✍ Scribed by Alain Leroux

Book ID: 113181014
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 336 KB
Volume: 43
Category: Article
ISSN: 0022-0531
DOI: 10.1016/0022-0531(87)90122-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Preferences and normal goods: A necessar

Preferences and normal goods: A necessary and sufficient condition

✍ Yves Alarie; Camille Bronsard; Pierre Ouellette 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 347 KB

Preferences and normal goods: An easy-to

Preferences and normal goods: An easy-to-check necessary and sufficient condition

✍ Ennio Bilancini; Leonardo Boncinelli 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 159 KB

A necessary and sufficient condition tha

A necessary and sufficient condition that an operator be normal

✍ R.G Douglas; Peter Rosenthal 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 60 KB

A procedural condition necessary and suf

A procedural condition necessary and sufficient for cyclic social preference

✍ Thomas Schwartz 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 151 KB

Sufficient conditions for good and prope

Sufficient conditions for good and proper error-detecting codes

✍ Dodunekova, R.; Dodunekov, S.M. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 156 KB

Plurality preference digraphs realized b

Plurality preference digraphs realized by trees—I. Necessary and sufficient conditions

✍ K.B. Reid; Weizhen Gu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 549 KB

In this paper we prove that an oriented graph D of order k is (n, n, k)-realizable by a tree of order n greater than k if and only if D is transitive and contains no induced anti-directed path of length 3 (i.e., D is series-parallel). We also derive some properties of an oriented graph D which is (n