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.
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
2005-02.
Length: 15 pages Date of creation: Jan 2005 Date of revision: Handle: RePEc:uct:uconnp:2005-02
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.: