A $O(\log m)$, deterministic, polynomial-time computable approximation of Lewis Carroll's scoring rule

Jason Covey, Christopher Homan

We provide deterministic, polynomial-time computable voting rules that approximate Dodgson's and (the ``minimization version'' of) Young's scoring rules to within a logarithmic fac…