User:Matijaskala/Probabilistic Approval Voting: Difference between revisions
User:Matijaskala/Probabilistic Approval Voting (view source)
Revision as of 20:31, 3 April 2020
, 4 years agono edit summary
m (grammar) |
Matijaskala (talk | contribs) No edit summary |
||
Line 7:
A reasonable choice for P(A,B) would be <math display="inline">\frac{V(A \and B)}{V(A \or B)}</math> which would give <math>\frac{V(A)}{1+\sum_{X \in W} \frac{V(A \and X)}{V(A \or X)}}</math> as the formula for the score of candidate A. In each step we elect the candidate with the highest score. This version of the system is 2-level [[Summability criterion|precinct-summable]] and passes the [[universally liked candidate criterion]].
<math display="inline">C</math> ... the set of all candidates
<math display="inline">W</math> ... the set of already elected candidates
<math display="inline">V(A)</math> ... number of voters who approve A
<math display="inline">V(A \and B)</math> ... number of voters who approve both A and B
<math display="inline">V(A \or B)</math> ... number of voters who approve A or B or both
== Score ballots ==
Probabilistic voting can be done with score ballots. We start by treating maximum score as approval. Once every candidate's score falls below [[Hare quota]] we progressively add lower scores.
[[Category:Proportional voting methods]]
[[Category:Approval methods]]
| |||