Two forms of continuity are defined for Pareto representations of preferences. They are designated “continuityâ€\x9D and “coordinate continuity.â€\x9D Characterizations are given of those Pareto representable preferences that are continuously representable and, in dimension...

A single formula assigns a continuous utility function to every representable preference relation.

Two forms of continuity are defined for Pareto representations of preferences. They are designated continuity and coordinate continuity. Characterizations are given of those Pareto representable preferences that are continuously representable and, in dimension two, of those that are...

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

Necessary and sufficient conditions are given for the existence of an Order isomorphism from a given preference relation to Euclidean n-dimensional space ordered by Pareto dominance. This result provides representation for some preference relations not representable by utility functions. It also...

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

Under what conditions are lexicographically representable preferences continuously representable? This question is actually two questions, since there are two natural definitions of continuity for lexicographic representations. A complete answer is given for one of these questions, and the other...

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