Uniform Banzhaf and Shapley–Shubik approximation lower bounds
Uniform Banzhaf and Shapley–Shubik approximation lower bounds
For each , let , and let be a simple game on voters. Uniform approximation lower-bound conjecture.
These bounds concern non-approximability of a concentrated desired power distribution; the supplied text gives no resolution.
Sources & referencesView supporting material
Primary source
Sascha Kurz, “Ready for the design of voting rules?”, arXiv:1405.0823 (2014).
Progress summary
Never refreshed
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.