We study sets of preferences that are convex with respect to the betweeness relation induced by the Kemeny distance for preferences. It appears that these sets consist of all preferences containing a certain partial ordering and the other way around all preferences containing a given partial ordering form a convex set. Next we consider restricted domains where each agent has a convex set of preferences. Necessary and sufficient conditions are formulated under which a restricted domain admits unanimous, strategy-proof and non-dictatorial choice rules. Loosely speaking it boils down to admitting monotone and non-image-dictatorial decision rules on two alternatives where the other alternatives are completely disregarded.
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.
Publisher Info
Paper provided by Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization in its series Research Memoranda with number
003.
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.: