Jump to content

Independence of irrelevant alternatives: Difference between revisions

Ranked pairs doesn't fail this criterion.
imported>Km-elmet
m (grammar)
(Ranked pairs doesn't fail this criterion.)
Line 1:
In [[voting system]]s, '''independence of irrelevant alternatives''' is the property some voting systems have that, if one option (X) wins the election, and a new alternative (Y) is added, only X or Y will win the election.
 
AllMost [[Condorcet method]]s fail this criterion, asalthough does[[Ranked Pairs]] satisfies theit. [[Borda count]], [[Coombs' method]], and [[Instant-runoff voting]] fail. [[Range voting]] satisfies the criterion.
 
[[Arrow's impossibility theorem]] states that no voting system can satisfy universal domain, non-imposition, non-dictatorship, unanimity, and independence of irrelevant alternatives. In practice, this means that no deterministic ranked ballot system can satisfy independence of irrelevant alternatives without either having a dictator (whose ballot decides who wins no matter the other ballots), failing to elect a candidate that the whole electorate ranks first, or rendering one or more outcomes impossible no matter the ballots.
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.