MathDB2 problems
- 0 votes0 replies0 views
The degree bound for unbiased non-transitive-symmetric graph voting rules
Degree-bound conjecture. There exist -regular graphs whose associated voting rules are unbiased but not transitive-symmetric whenever
- 0 votes0 replies0 views
The square-root-logarithmic bound for unbiased totally asymmetric voting rules
Square-root-logarithmic bound conjecture. There exist voting rules that are unbiased, totally asymmetric, and have winning coalitions of size