Winner set: Difference between revisions
m
typoediting
No edit summary |
m (typoediting) |
||
| (One intermediate revision by one other user not shown) | |||
Line 1:
A winner set is a set of candidates equal in size to the number of seats to be filled. When there is only one seat to be filled, it is customary to refer to a winner set simply as a candidate.
Winner sets feature prominently in discussions on who to elect in multi-winner [[Bloc voting|bloc voting]] methods and [[Proportional representation|proportional representation]] methods. Properties such as [[Stable Winner Set|stability]] and [[Proportionality for Solid Coalitions]] offer suggestions as to who should be in the winning winner set, with [[combinatorics]] and [[Set theory|set theory]] featuring prominently in the discussion.
[[Multi-member_system#Sequential_proportional_methods | Sequential proportional voting methods]] elect a winner set one candidate at a time, while optimal proportional methods involve evaluating every possible winner set. In the single-winner case, there are
==References==
<references/>
▲Sequential proportional voting methods elect a winner set one candidate at a time, while optimal proportional methods involve evaluating every possible winner set. In the single-winner case, there are only [number of candidates] winner sets, but there are exponentially more winner sets with more winners. For example, with 10 candidates and 3 winners, there are 120 possible winner sets.
[[Category:Proportionality-related concepts]]
| |||