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 voting aggregates of utility functions. Pareto dominance on n-dimensional Euclidean space and the threshold of detectable difference relation are pairwise unanimous voting aggregates of utility functions. Separability conditions are established for voting aggregates, and used to show that the lexicographic order is not a pairwise unanimous voting aggregate of utility functions, and Pareto dominance is not a pairwise majority voting aggregate of utility functions.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: