Approximately Strategyproof Tournament Rules in the Probabilistic Setting

Kimberly Ding, S. Matthew Weinberg

We consider the manipulability of tournament rules which map the results of $\left(\genfrac{}{}{0ex}{}{n}{2}\right)$ pairwise matches and select a winner. Prior work designs simple tournament rules such tha…