Let's say that a candidate A proposes a decision. The probability that a candidate supports the decision equals . Expected number of votes that the decision gets equals or per voter. To minimize number of votes per voter we maximize for each newly elected candidate.
Example
29 AB
1 B
14 C
In each step we elect the candidate with the highest .
First seat:
A:
B:
C:
B is elected
Second seat:
A:
C:
A is elected
Score ballots
One possible procedure to elect a candidate using 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.