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,...

Voting theory has always focused on mechanism design, but this paper shows that voting theory is also a useful tool in the field of preference representation. Both the lexicographic order on n-dimensional Euclidean space and the threshold of detectable difference relation are pairwise majority...

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