5 problems
- 0 votes0 replies0 views
Polynomial or linear dependence in the approximate polymorphism theorem
Quantitative approximate polymorphism conjecture. The dependence between and in the Alekseev--Filmus theorem can be improved to polynomial or even linear.
- 0 votes0 replies0 views
The logarithmic quantitative sumset conjecture
Quantitative sumset conjecture. For every ,
- 0 votes0 replies1 view
Asymptotic probability of no generalized Condorcet winner in the quantitative Arrow step
Fix . For each , let be the probability lower bound supplied by the lemma for a neutral, independent-of-irrelevant-alternatives generalized social welfare f…
- 0 votes0 replies0 views
Quantitative Gibbard–Satterthwaite generalization to more than three alternatives
Let be the number of alternatives, and let the quantitative Gibbard–Satterthwaite theorem refer to a bound on the manipulation power of a social choice function in terms of i…
- 0 votes0 replies0 views
Mossel's polynomial dependence conjecture for quantitative Arrow's theorem
Let a generalized social welfare function (GSWF) on three alternatives satisfy the independent conditions of Arrow's theorem, and let . Suppose that the probability of…