Resumen de A note on the voting problem.

Miguel Ángel Fiol Mora

• Let v(n) be the minimum number of voters with transitive preferences which are needed to generate any strong preference pattern (ties not allowed) on n candidates. Let k = [log2n]. Then it is shown that v(n) = n-k if n and k have different parity, and v(n) = n-k+1 otherwise