increasing ability order and then the least able $m$ jurors vote in descending ability order. We already know from Theorem \[thm:optimal-sequence\] that ADO is optimal for $n=3$. Using simulation techniques, we establish that the ADO is an excellent heuristic (and possibly optimal) for $n=5$ and $n=7$.

To conclude the section, we remark that our problem can be viewed as a simple optimization problem faced by a decision maker, who has an unordered set of people to form a jury to help him make a binary decision. He wants to arrange their voting order so as to make the majority decision of the jury as reliable as possible. On the other hand, we can also view our problem more game theoretically as a Stackelberg game or principal agent problem. First, we are given an unordered set of jurors. The Principal, who moves first, selects an order in which they must vote. He wins the game (payoff $1$; otherwise payoff $0$) if the *majority verdict* is the true state of Nature. Then the jurors vote openly in the order selected by the Principal. In this sub-game, a juror wins (payoff $1$; otherwise payoff $0$) if his *vote* is the same as the 