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.

Legal Change and the Social Value of Lawsuits

This paper integrates the literatures on the social value of lawsuits, the evolution of the law, and judicial preferences to evaluate the hypothesis that the law evolves toward efficiency. The setting is a simple accident model with costly litigation where the efficient law minimizes the sum of accident plus litigation costs. In the steady state equilibrium, the distribution of legal rules is not necessarily efficient but instead depends on a combination of selective litigation, judicial bias, and precedent.