Tight Bounds on 3-Team Manipulations in Randomized Death Match

Atanas Dinev, S. Matthew Weinberg

Consider a round-robin tournament on n teams, where a winner must be (possibly randomly) selected as a function of the results from the $\left(\genfrac{}{}{0ex}{}{n}{2}\right)$ pairwise matches. A tourname…