A characterization of the single-peaked domain
نویسندگان
چکیده
We provide in this paper a pair of properties that are both necessary and sufficient to characterize the domain of single-peaked preference profiles. This characterization allows for a definition of single-peaked preference profiles without using an ad-hoc unlerlying order of the alternatives and also sheds light on the structure of single-peaked profiles. Considering the larger domain of value-restricted preference profiles (Sen, A Possibility Theorem on Majority Decisions, Econometrica, 1966) we also provide necessary and sufficient conditions for a preference profile to be single-caved or group-separable. Our results show that for single-peaked, single-caved and group-separable profiles it is sufficient to restrict to profiles containing of either three individuals and three alternatives or two individuals and four alternatives.
منابع مشابه
The Single-Peaked Domain Revisited: A Simple Global Characterization
It is proved that, among all restricted preference domains that guarantee consistency (i.e. transitivity) of pairwise majority voting, the single-peaked domain is the only minimally rich and connected domain that contains two completely reversed strict preference orders. It is argued that this result explains the predominant role of single-peakedness as a domain restriction in models of politic...
متن کاملA Characterization of the Single-Peaked Single-Crossing Domain
We investigate elections that are simultaneously singlepeaked and single-crossing (SPSC). We show that the domain of 1-dimensional Euclidean elections (where voters and candidates are points on the real line, and each voter prefers the candidates that are close to her to the ones that are further away) is a proper subdomain of the SPSC domain, by constructing an election that is single-peaked a...
متن کاملA Characterization of Single-Peaked Preferences via Random Social Choice Functions
The paper proves the following result: every path-connected domain of preferences that admits a strategy-proof, unanimous, tops-only random social choice function satisfying a compromise property, is single-peaked. Conversely, every single-peaked domain admits a random social choice function satisfying these properties. Single-peakedness is defined with respect to arbitrary trees. We also show ...
متن کاملANY OPINIONS EXPRESSED ARE THOSE OF THE AUTHOR(S) AND NOT NECESSARILY THOSE OF THE SCHOOL OF ECONOMICS, SMU A Characterization of Single-Peaked Preferences via Random Social Choice Functions
The paper proves the following result: every path-connected domain of preferences that admits a strategy-proof, unanimous, tops-only random social choice function satisfying a compromise property, is single-peaked. Conversely, every single-peaked domain admits a random social choice function satisfying these properties. Single-peakedness is defined with respect to arbitrary trees. We also show ...
متن کاملSingle-peakedness Based on the Net Preference Matrix: Characterization and Algorithms
In this paper, we propose a new relaxation of the single-peaked property by constraining the net preference matrix instead of the preference profile. More precisely, this new domain restriction holds for a given profile P if there exists a single-peaked profile P ′ with the same net preference matrix as P. We provide a characterization of net preference matrices that can be “implemented” by a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Choice and Welfare
دوره 36 شماره
صفحات -
تاریخ انتشار 2011