Finite Characterizations and Paretian Preferences
A characterization of a property of binary relations is of finite type if it is stated in terms of ordered T-tuples of alternatives for some positive integer T. A characterization of finite type can be used to determine in polynomial time whether a binary relation over a finite set has the property characterized. Unfortunately, Pareto representability in R2 has no characterization of finite type (Knoblauch, 2002). This result is generalized below Rl, l larger than 2. The method of proof is applied to other properties of binary relations.
|Date of creation:||Jan 2005|
|Date of revision:|
|Contact details of provider:|| Postal: University of Connecticut 365 Fairfield Way, 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
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.:
- Vicki Knoblauch, 2003.
"Characterizing Paretian Preferences,"
2003-30, University of Connecticut, Department of Economics.
- 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:uct:uconnp:2005-02. 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: (Mark McConnel)
If references are entirely missing, you can add them using this form.