Characterizing Paretian Preferences
AbstractA 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by University of Connecticut, Department of Economics in its series Working papers with number 2003-30.
Length: 11 pages
Date of creation: Aug 2003
Date of revision:
Contact details of provider:
Postal: University of Connecticut 341 Mansfield Road, Unit 1063 Storrs, CT 06269-1063
Phone: (860) 486-4889
Fax: (860) 486-4463
Web page: http://www.econ.uconn.edu/
More information through EDIRC
preferences; Pareto order; voting;
Other versions of this item:
- D11 - Microeconomics - - Household Behavior - - - Consumer Economics: Theory
- D70 - Microeconomics - - Analysis of Collective Decision-Making - - - General
This paper has been announced in the following NEP Reports:
- NEP-ALL-2003-08-31 (All new papers)
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.
- Vicki Knoblauch, 2005. "Finite Characterizations and Paretian Preferences," Working papers 2005-02, University of Connecticut, Department of Economics.
- Vicki Knoblauch, 2008. "Binary Relations: Finite Characterizations and Computational Complexity," Theory and Decision, Springer, vol. 65(1), pages 27-44, August.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Kasey Kniffin).
If references are entirely missing, you can add them using this form.