Winner set: Difference between revisions

m
typoediting
(Created page with "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 simpl...")
 
m (typoediting)
 
(2 intermediate revisions by 2 users 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]] mandateoffer suggestions as to who mustshould 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 the same nubmer of winner sets as candidates. [[Multi-member system]] systems must use the [[ W:Combination | combinatorial choose method]] as in "number of candidates '''''choose'''''<ref>https://mathworld.wolfram.com/Choose.html</ref> number of winners". For example, with 10 candidates and 3 winners, there are 120 possible winner sets since 10 choose 3 =120.
 
==References==
<references/>
 
[[Category:Proportionality-related concepts]]
1,196

edits