Probabilistic Approval Voting
Derivation[edit | edit source]
Let's say that there is a function which returns the probability that two given candidates belong to the same political faction. Then for a given candidate A, the expected number of elected candidates belonging to the same faction equals and A's voter efficiency equals . If A is not already elected then we can calculate the A's voter efficiency after A's election as . Let's call A's score and A's inverse score. If we keep electing candidates whose inverse score is at least as low as inverse Hare quota then we can expect an outcome where each winner's voter efficiency is below a certain limit aka a proportional outcome.
In practice, electing a candidate whose inverse score is at least as low as inverse Hare quota will not always be possible. In that case we need to either add fail-safe approvals which we previously didn't consider or elect the candidate with the lowest inverse score and hope it is low enough.
A reasonable choice for P(A,B) would be which would give 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 precinct-summable and passes the universally liked candidate criterion.
Score ballots[edit | edit source]
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.