Multivalued decision rules and coalitional nonmanipulability. Two possibility theorems
From MaRDI portal
Recommendations
Cites work
- Limited resoluteness and strategic voting: The case of linear sincere preference orderings
- Manipulation of Voting Schemes: A General Result
- Manipulation of social choice functions
- On Schwartz's rule
- On a class of strictly nonmanipulable collective choice rules
- Social choice and individual values
- Strategic voting under minimally binary group decision functions
- Strategy-Proofness and Social Choice Functions without Singlevaluedness
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
Cited in
(7)- Vote swapping in irresolute two-tier voting procedures
- Coalitionally strategy-proof social choice correspondences and the Pareto rule
- Set-monotonicity implies Kelly-strategyproofness
- Characterizing the top cycle via strategyproofness
- Manipulation of nonimposed, nonoligarchic, nonbinary group decision rules
- Coalitional manipulation and the Pareto rule
- Limited resoluteness and strategic voting: The case of linear sincere preference orderings
This page was built for publication: Multivalued decision rules and coalitional nonmanipulability. Two possibility theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q374843)