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.
@article{urn:eudml:doc:39290,
title = {A note on the voting problem.},
journal = {Stochastica},
volume = {13},
year = {1992},
pages = {155-158},
zbl = {0767.90007},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:39290}
}
Fiol Mora, Miguel Angel. A note on the voting problem.. Stochastica, Tome 13 (1992) pp. 155-158. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39290/