Asymptotic unfairness under convergent weight distributions
Asymptotic unfairness under convergent weight distributions
Let be a sequence of weight distributions with corresponding probability distributions , where is a probability distribution on . Let be a weight distribution whose corresponding probability distribution satisfies
Consider a sequence of -splittings of a node , with for , where the limiting terms form an -splitting . For a voting scheme with voting-power function and the corresponding distributions and node weights after splitting, write and for the resulting distribution and probability, and similarly at infinity. Asymptotic unfairness conjecture. For every ,
The claim asserts that the gain in voting power caused by the splitting remains strictly positive in the limit, so the voting scheme is not asymptotically fair for these convergent sequences of weight distributions. The supplied context discusses this as an asymptotic-unfairness phenomenon, but does not establish the displayed assertion or provide a resolution status.
Sources & referencesView supporting material
Primary source
Abraham Gutierrez, Sebastian Müller and Stjepan Šebek, “On asymptotic fairness in voting with greedy sampling”, arXiv:2101.11269 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.