The performance guarantee of randomized perfect voting trees

Abstract

In this note we study randomized voting trees, previously introduced by Fisher, Procaccia and Samorodnitsky. They speculate that a non-trivial performance guarantee may be achievable using randomized, balanced trees whose height is carefully chosen. We explore some connections to the so-called Volterra quadratic stochastic operators, and show that uniformly random voting trees cannot provide a performance guarantee that is linear in the number of individuals.

9 pages