Manipulability of consular election rules
From MaRDI portal
Abstract: The Gibbard-Satterthwaite theorem is a cornerstone of social choice theory, stating that an onto social choice function cannot be both strategy-proof and non-dictatorial if the number of alternatives is at least three. The Duggan-Schwartz theorem proves an analogue in the case of set-valued elections: if the function is onto with respect to singletons, and can be manipulated by neither an optimist nor a pessimist, it must have a weak dictator. However, the assumption that the function is onto with respect to singletons makes the Duggan-Schwartz theorem inapplicable to elections which necessarily select a committee with multiple members. In this paper we make a start on this problem by considering elections which elect a committee of size two (such as the consulship of ancient Rome). We establish that if such a consular election rule cannot be expressed as the union of two disjoint social choice functions, then strategy-proofness implies the existence of a dictator. Although we suspect that a similar result holds for larger sized committees, there appear to be many obstacles to proving it, which we discuss in detail.
Recommendations
- Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized
- A Quantitative Version of the Gibbard–Satterthwaite Theorem for Three Alternatives
- A note on the manipulation of social choice correspondence
- On the manipulation of social choice correspondences
- The Manipulability of Voting Systems
Cites work
- scientific article; zbMATH DE number 3635767 (Why is no real title available?)
- A general impossibility result on strategy-proof social choice hyperfunctions
- A leximin characterization of strategy-proof and non-resolute social choice procedures
- Axiomatic characterization of committee scoring rules
- Complexity of strategic behavior in multi-winner elections
- Dictatorial domains
- Generalizing the Gibbard-Satterthwaite theorem: partial preferences, the degree of manipulation, and multi-valuedness
- How to choose a non-controversial list with \(k\) names
- Manipulation of Schemes that Mix Voting with Chance
- Manipulation of Voting Schemes: A General Result
- On the rule of \(k\) names
- Ranking committees, income streams or multisets
- Stability in Voting
- Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized
- Strategy-Proofness and Social Choice Functions without Singlevaluedness
- Strategy-proof resolute social choice correspondences
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- The Manipulability of Voting Systems
- The Manipulation of Social Choice Mechanisms that Do Not Leave "Too Much" to Chance
- Voting by Committees
- Voting by committees under constraints
This page was built for publication: Manipulability of consular election rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2417407)