Cardinal proportional representation: Difference between revisions

no edit summary
No edit summary
Line 8:
When investigating cardinal PR, it is often categorized into optimal PR methods, which generally work by assigning every possible [[Winner set|winner set]] a score based on how good it is, and picking the best winner set out of all possible winner sets, and sequential PR methods, which elect one candidate at a time. Optimal PR has the issue of being non-hand-countable and very computationally expensive and complex (in fact, with large committees, they may be both completely impossible to compute and very, very vulnerable to strategic voting<ref>{{Cite web|url=https://www.rangevoting.org/QualityMulti.html|title="Optimal proportional representation" multiwinner voting systems I: methods, algorithms, advantages, and inherent flaws|last=|first=|date=|website=|url-status=live|archive-url=|archive-date=|access-date=}}</ref>), so in practice, many sequential cardinal PR methods are designed to approximate certain optimal PR methods. When simulating the quality of various cardinal PR methods, sometimes it's common to use optimal PR methods more as "benchmarks" of how good the winner set chosen by the sequential method is, rather than as an actual way of running an election.
 
The [[KP transform]] can be very useful in allowing '''Approval PR''' methods ([[Approval voting]]-based cardinal PR methods) to work with rated ballots with more than two allowed scores.
 
=== Optimal methods ===
Line 22:
 
== Notes ==
Because rated voting methods allow a voter to give no candidate the highest score, it is possible to give some voters less power to their ballots if they choose it. See [[normalization]] for discussion on this.
 
Just about all cardinal PR methods are immune to Woodall [[Free riding|free riding]], though their vulnerability to Hylland [[Free riding|free riding]] varies. Some, like [[Sequentially Shrinking Quota]], are maximally resistant.