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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Publisher Info
Paper 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: Handle: RePEc:uct:uconnp:2003-30
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
For technical questions regarding this item, or to correct its listing, contact: (Christian Zimmermann).
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.:
Cited by: (explanations, 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.)