Stable winner set: Difference between revisions
no edit summary
m (Fix typo) |
No edit summary |
||
| (2 intermediate revisions by 2 users not shown) | |||
Line 1:
In proportional representation, a '''stable winner set''' (called the '''core''' in game theory parlance<ref>{{Cite journal|title=|url=https://dl.acm.org/doi/abs/10.1145/3357713.3384238|journal=}}</ref><ref>{{Cite journal|title=|url=https://arxiv.org/pdf/1911.11747.pdf|journal=}}</ref>) is a requirement on a winner set:
{{Definition| Given a winner set <math>S</math> of <math>k</math> winners, another winner set <math>S^\prime</math> containing <math>k^\prime</math> winners blocks <math>S</math> iff <math>\frac{V(S,S^\prime)}{n} \geq \frac{K^\prime}{K}</math>, where <math>V(S,S^\prime)</math> is the number of voters who strictly prefer <math>S^\prime</math> to <math>S</math>, and <math>n</math> is the number of voters.
| |||