Techniques of method design: Difference between revisions
Content deleted Content added
imported>Allens m Typo. |
m →Steps |
||
| (2 intermediate revisions by 2 users not shown) | |||
Line 28:
* '''Runoff''': Special case of reduction to a subset, for example by removing worst candidate according to some score. Can be iterated.
* '''Ordering''': Many methods involve the construction of an ordering of the candidates or the defeats, not to be interpreted as a social order, but only as an intermediate tool.
* '''Randomization''': Using a certain amount of randomness can help avoiding some strategies, especially when it leads to each candidate being beaten by a possible winner. <!-- Instant-runoff voting is a well-known technique for selecting winners at random, while still maintaining the appearance of fairness. -->
== Special sets ==
Line 37:
* '''Banks set''' = ''set of candidates which are top on some maximal sub-chain of the defeat graph.'' Not monotonic as a set.
* Dutta's '''Minimal covering set''' = ''smallest non-empty set such that when any other candidate is added, that candidate is covered in the resulting set.
* '''Bipartisan set''' = ''set of candidates getting non-zero probability in the [[bipartisan distribution]].''
* Forest Simmons' set '''P''' = ''set of candidates which are not approval-consistently defeated.'' This set is totally ordered by the defeats and contains the most approved candidate and a possible Condorcet winner.
Line 50:
* '''Randomized order''': Use a random process to determine the order in which the candidates are processes in some way.
* '''Final randomization''': Restrict to some subset, then use a random process to choose from that set.
[[Category:Voting theory]]
| |||