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.
Recommended Citation
Knoblauch, Vicki, "Finite Characterizations and Paretian Preferences" (2005). Economics Working Papers. 200502.
https://digitalcommons.lib.uconn.edu/econ_wpapers/200502
COinS