Knockout tournaments admitting all candidates as winners

A set of 2ⁿ candidates is presented to a commission. At every round, each member of the commission votes by pairwise comparison, and one-half of the candidates is deleted from the tournament, the remaining candidates proceeding to the next round until the n-th round (the final one) in which a winner is declared. The candidates are arranged on a blackboard in a given order, with the relative order among the candidates maintained at all rounds. In the case of 2ⁿ candidates, with n ≥ 3, we identify a voting profile for which any candidate could win just by choosing a proper initial order of the candidates. A study on the size of the commission is carried out in order to obtain the desired result of any candidate being a possible winner. We construct such a commission with $4n -3$ voters for 2ⁿ candidates. Moreover, in the setting of a random number of voters, we obtain the same results, with high probability, when the expected number of voters is large.