Manipulation and Single-Peakedness: A General Result

نویسندگان

  • Elizabeth Maggie Penn
  • Sean Gailmard
  • Scott Ashworth
  • Ethan Bueno de Mesquita
  • Stephen Coate
  • Adam Meirowitz
  • Tom Schwartz
چکیده

This article considers environments in which individual preferences are single-peaked with respect to an unspecified, but unidimensional, ordering of the alternative space. We show that in these environments, any institution that is coalitionally strategy-proof must be dictatorial. Thus, any nondictatorial institutional environment that does not explicitly utilize an a priori ordering over alternatives in order to render a collective decision is necessarily prone to the strategic misrepresentation of preferences by an individual or a group. Moreover, we prove in this environment that for any nondictatorial institution, the truthful revelation of preferences can never be a dominant strategy equilibrium. Accordingly, an incentive to behave insincerely is inherent to the vast majority of real-world lawmaking systems, even when the policy space is unidimensional and the core is nonempty.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling Single-Peakedness for Votes with Ties

Single-peakedness is one of the most important and well-known domain restrictions on preferences. The computational study of single-peaked electorates has largely been restricted to elections with tie-free votes, and recent work that studies the computational complexity of manipulative attacks for single-peaked elections for votes with ties has been restricted to nonstandard models of single-pe...

متن کامل

The Complexity of Nearly Single-Peaked Consistency1

Manipulation, bribery, and control are well-studied ways of changing the outcome of an election. Many voting systems are in the general case computationally resistant to some of these manipulative actions. However when restricted to single-peaked electorates, these problems suddenly become easy to solve. Recently, Faliszewski, Hemaspaandra, and Hemaspaandra [FHH11] studied the complexity of dis...

متن کامل

Computational Aspects of Nearly Single-Peaked Electorates

Manipulation, bribery, and control are well-studied ways of changing the outcome of an election. Many voting systems are, in the general case, computationally resistant to some of these manipulative actions. However when restricted to single-peaked electorates, these systems suddenly become easy to manipulate. Recently, Faliszewski, Hemaspaandra, and Hemaspaandra (2011b) studied the complexity ...

متن کامل

Intradimensional Single-Peakedness and the Multidimensional Arrow Problem

Arrow's account (1951/1963) of the problem of social choice is based upon the assumption that the preferences of each individual in the relevant group are expressible by a single ordering. This paper lifts that assumption and develops a multidimensional generalization of Arrow's framework. I show that, like Arrow's original framework, the multidimensional generalization is affected by an imposs...

متن کامل

The Geometry of Black’s Single Peakedness and Related Conditions

“Black single peakedness” is a widely used restriction imposed on profiles. By using geometry to analyze all possible three candidate profiles satisfying this constraint, we discover that it allows subtle and disturbing election behavior. The same analysis is applied to the related profile constraints where some candidate never is top-ranked and some candidate never is bottom ranked.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011