Strategic manipulation in voting games when lotteries and ties are permitted
From MaRDI portal
Publication:697934
Recommendations
- Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized
- Gibbard-Satterthwaite games for \(k\)-approval voting rules
- Strategyproof social choice when preferences and outcomes may contain ties
- scientific article; zbMATH DE number 3898540
- A Quantitative Version of the Gibbard–Satterthwaite Theorem for Three Alternatives
Cites work
- scientific article; zbMATH DE number 3635767 (Why is no real title available?)
- Manipulation of Schemes that Mix Voting with Chance
- Manipulation of Voting Schemes: A General Result
- Multi-valued strategy-proof social choice rules
- Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized
- Strategy-Proofness and Pivotal Voters: A Direct Proof of the Gibbard-Satterthwaite Theorem
- Strategy-proof probabilistic rules for expected utility maximizers
- Strategy-proof social choice correspondences.
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- The Manipulation of Social Choice Mechanisms that Do Not Leave "Too Much" to Chance
- Three brief proofs of Arrow's impossibility theorem
- Voting by Committees
Cited in
(34)- Incentives in social decision schemes with pairwise comparison preferences
- Generalizing the Gibbard-Satterthwaite theorem: partial preferences, the degree of manipulation, and multi-valuedness
- Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes
- Strategy-proof resolute social choice correspondences
- Monotonicity properties and their adaptation to irresolute social choice rules
- Choosers as extension axioms
- Fully sincere voting
- Arrovian aggregation for preferences over sets
- Uniform expected utility criteria for decision making under ignorance or objective ambiguity
- A unifying impossibility theorem
- On strategy-proof social choice correspondences
- A fundamental structure of strategy-proof social choice correspondences with restricted preferences over alternatives
- A general impossibility result on strategy-proof social choice hyperfunctions
- Strategic candidacy for multivalued voting procedures
- Social Choice Theory
- Arrovian impossibilities in aggregating preferences over non-resolute outcomes
- Coalitionally strategy-proof social choice correspondences and the Pareto rule
- Expected utility consistent extensions of preferences
- Impossibilities for strategy-proof committee selection mechanisms with vetoers
- Evaluationwise strategy-proofness
- On the manipulation of social choice correspondences
- Manipulation in elections with uncertain preferences
- Strategic voting in the context of stable-matching of teams
- Strategic nomination and non-manipulable voting procedures
- On the Indecisiveness of Kelly-Strategyproof Social Choice Functions
- scientific article; zbMATH DE number 6868551 (Why is no real title available?)
- Tops-only domains
- Characterizing the top cycle via strategyproofness
- scientific article; zbMATH DE number 7450033 (Why is no real title available?)
- Manipulation in games with multiple levels of output
- An impossibility result for virtual implementation with status quo
- Manipulating the quota in weighted voting games
- Strategyproof social choice when preferences and outcomes may contain ties
- Further Results on the Manipulability of Social Choice Rules—A Comparison of Standard and Favardin–Lepelley Types of Individual Manipulation
This page was built for publication: Strategic manipulation in voting games when lotteries and ties are permitted
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697934)
