Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.



#choice #condorcet-winning-set #consensus-recommendation #multiwinner-election #social
The notion of a θ -winning set provides a natural way to define two families of more decisive voting correspondences using the same approach: First, we can pick a θ ∈ (0, 1] and output all candidates that belong to some minimal (or minimum-size) θ-winning set. Alternatively, we can fix the desired size of the winning set (say, k), find the largest value of θ such that there exists a θ-winning set of size k, and output all candidates that belong to some such set. A variant of the latter approach is to pick one θ -winning set of size k according to some tie-breaking rule, thus obtaining a committee selection r ule (see Sect. 7)
If you want to change selection, open document below and click on "Move attachment"

pdf

owner: rappatoni - (no access) - Elkin 2014.pdf, p12


Summary

statusnot read reprioritisations
last reprioritisation on suggested re-reading day
started reading on finished reading on

Details



Discussion

Do you want to join discussion? Click here to log in or create user.