相关论文: Manipulability of consular election rules
The Gibbard-Satterthwaite theorem states that every non-dictatorial election rule among at least three alternatives can be strategically manipulated. We prove a quantitative version of the Gibbard-Satterthwaite theorem: a random…
The classic Gibbard-Satterthwaite theorem says that every strategy-proof voting rule with at least three possible candidates must be dictatorial. Similar impossibility results hold even if we consider a weaker notion of strategy-proofness…
By endowing the class of tops-only and efficient social choice rules with a dual order structure that exploits the trade-off between different degrees of manipulability and dictatorial power rules allow agents to have, we provide a proof of…
The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability that was proposed by…
The classic Gibbard-Satterthwaite theorem says that every strategy-proof voting rule with at least three possible candidates must be dictatorial. In \cite{McL11}, McLennan showed that a similar impossibility result holds even if we consider…
By the Gibbard--Satterthwaite theorem, every reasonable voting rule for three or more alternatives is susceptible to manipulation: there exist elections where one or more voters can change the election outcome in their favour by…
The Gibbard-Satterthwaite theorem implies the existence of voters, called manipulators, who can change the election outcome in their favour by voting strategically. When a given preference profile admits several such manipulators, voting…
The Duggan-Schwartz theorem (Duggan and Schwartz, 1992) is a famous result concerning strategy-proof social choice correspondences, often stated as "A social choice correspondence that can be manipulated by neither an optimist nor a…
It is well known, by the Gibbard-Satterthwaite Theorem, that when there are more than two candidates, any non-dictatorial voting rule can be manipulated by untruthful voters. But how strong is the incentive to manipulate under different…
The celebrated Gibbard-Satterthwaite Theorem states that any surjective social choice function which is defined over the universal domain of preferences and is strategy-proof must be dictatorial. Aswal, Chatterji and Sen generalize the…
Let g be a strategy-proof rule on the domain NP of profiles where no alternative Pareto-dominates any other. Then we establish a result with a Gibbard-Satterthwaite flavor: g is dictatorial if its range contains at least three alternatives.
Let g be a strategy-proof rule on the domain NP of profiles where no alternative Pareto-dominates any other and let g have range S on NP. We complete the proof of a Gibbard-Satterthwaite result - if S contains more than two elements, then g…
Multi-winner approval-based voting has received considerable attention recently. A voting rule in this setting takes as input ballots in which each agent approves a subset of the available alternatives and outputs a committee of…
Recently, quantitative versions of the Gibbard-Satterthwaite theorem were proven for $k=3$ alternatives by Friedgut, Kalai, Keller and Nisan and for neutral functions on $k \geq 4$ alternatives by Isaksson, Kindler and Mossel. We prove a…
Manipulation is a problem of fundamental importance in the context of voting in which the voters exercise their votes strategically instead of voting honestly to prevent selection of an alternative that is less preferred. The…
We prove a quantitative version of the Gibbard-Satterthwaite theorem. We show that a uniformly chosen voter profile for a neutral social choice function f of $q \ge 4$ alternatives and n voters will be manipulable with probability at least…
Gibbard and Satterthwaite have shown that the only single-valued social choice functions (SCFs) that satisfy non-imposition (i.e., the function's range coincides with its codomain) and strategyproofness (i.e., voters are never better off by…
The Gibbard-Satterthwaite Impossibility Theorem holds that dictatorship is the only Pareto optimal and strategyproof social choice function on the full domain of preferences. Much of the work in mechanism design aims at getting around this…
We prove that every Condorcet-consistent voting rule can be manipulated by a voter who completely reverses their preference ranking, assuming that there are at least 4 alternatives. This corrects an error and improves a result of [Sanver,…
The Gibbard-Satterthwaite theorem established that no non-trivial voting rule is strategy-proof, but that does not mean that all voting rules are equally susceptible to strategic manipulation. Over the past fifty years numerous approaches…