User:Matijaskala/Probabilistic Approval Voting: Difference between revisions

* <math display="inline">C</math> ... the set of all candidates

* <math display="inline">W</math> ... the set of already elected candidates

 

Let's say that there is a function <math>P:C \times C \to [0, 1]</math> that maps two given candidates to the probability that they belong to the same political faction. Then for a given candidate ''A'', the expected number of elected candidates belonging to the same faction equals <math display="inline">\sum_{X \in W} P(A,X)</math> and ''A''<nowiki/>'s voter efficiency equals <math display="inline">\frac{\sum_{X \in W} P(A,X)}{V(A)}</math>. If ''A'' is not already elected then we can calculate the ''A''<nowiki/>'s voter efficiency after ''A''<nowiki/>'s election as <math display="inline">\frac{1+\sum_{X \in W} P(A,X)}{V(A)}</math>. Let's call <math display="inline">\frac{V(A)}{1+\sum_{X \in W} P(A,X)}</math> ''A''<nowiki/>'s score and <math display="inline">\frac{1+\sum_{X \in W}P(A,X)}{V(A)}</math> ''A''<nowiki/>'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.