Characterizing Paretian preferences
A characterization of a property of binary relations is of type M if it can be stated in terms of ordered M-tuples of alternatives. A characterization of finite type provides an easy test of whether preferences over a large set of alternatives possesses the property characterized. Unfortunately, there is no characterization of finite type for Pareto representability in R..2. A partial result along the same lines is obtained for Pareto representability in R..k, k .. 2.
(This abstract was borrowed from another version of this item.)
Volume (Year): 25 (2005)
Issue (Month): 1 (October)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00355/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Sprumont, Yves, 2001. "Paretian Quasi-orders: The Regular Two-Agent Case," Journal of Economic Theory, Elsevier, vol. 101(2), pages 437-456, December.
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:25:y:2005:i:1:p:179-186. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.