Finite Characterizations and Paretian Preferences

Vicki Knoblauch ()

No 2005-02, Working papers from University of Connecticut, Department of Economics

Abstract: 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.

Keywords: preferences; Pareto order; voting (search for similar items in EconPapers)
JEL-codes: D11 D70 (search for similar items in EconPapers)
Pages: 15 pages
Date: 2005-01
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://media.economics.uconn.edu/working/2005-02.pdf Full text (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:uct:uconnp:2005-02

Access Statistics for this paper

More papers in Working papers from University of Connecticut, Department of Economics University of Connecticut 365 Fairfield Way, Unit 1063 Storrs, CT 06269-1063. Contact information at EDIRC.
Bibliographic data for series maintained by Mark McConnel ().