Skip navigation
Please use this identifier to cite or link to this item:
Title: On the Manipulability of Tournament Rules by Throwing Matches
Authors: Sathyanarayanan, Sacheth
Advisors: Weinberg, Matt
Department: Computer Science
Class Year: 2023
Publisher: Princeton, NJ : Princeton University
Abstract: A Tournament Rule takes as input a set of $\binom{n}{2}$ pairwise match results on $n$ teams and (possibly randomly) selects a ranking of teams, with a prize associated to each place in the ranking. Two teams may manipulate their match outcomes to try and improve their expected prize winnings. [SSW17] and subsequent works seek to understand the minimum manipulability among all ``reasonable'' tournament rules (i.e. tournament rules so that if team $x$ defeats every other team, it is ranked first with probability $1$), when these two teams fix the match between them. Our work instead considers the possibility that two teams may both fix the match between them, and additionally throw matches to outside teams (that is, they can intentionally lose a match to a non-colluding team that they could have won). Our main result establishes that no two teams can gain more than $1/3$ in expected prize winnings in Nested Randomized King of the Hill (introduced in [DaleFRSW22], similar to QuickSort), by together fixing their match and throwing matches to external teams. This is optimal, as any ``reasonable'' tournament admits the possibility of two teams gaining $1/3$ in expected prize-winnings just by fixing the match between them.
Type of Material: Academic dissertations (M.S.E.)
Language: en
Appears in Collections:Computer Science, 2023

Files in This Item:
File Description SizeFormat 
Sathyanarayanan_princeton_0181G_14576.pdf835.62 kBAdobe PDFView/Download

Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.