Approximately Strategyproof Tournament Rules in the Probabilistic Setting

01/10/2021
by   Kimberly Ding, et al.
0

We consider the manipulability of tournament rules which map the results of n2 pairwise matches and select a winner. Prior work designs simple tournament rules such that no pair of teams can manipulate the outcome of their match to improve their probability of winning by more than 1/3, and this is the best possible among any Condorcet-consistent tournament rule (which selects an undefeated team whenever one exists) [Schneider et al., 2017, Schvartzman et al., 2020]. These lower bounds require the manipulators to know precisely the outcome of all future matches. We take a beyond worst-case view and instead consider tournaments which are "close to uniform": the outcome of all matches are independent, and no team is believed to win any match with probability exceeding 1/2+ε. We show that Randomized Single Elimination Bracket [Schneider et al., 2017] and a new tournament rule we term Randomized Death Match have the property that no pair of teams can manipulate the outcome of their match to improve their probability of winning by more than ε/3 + 2ε^2/3, for all ε, and this is the best possible among any Condorcet-consistent tournament rule. Our main technical contribution is a recursive framework to analyze the manipulability of certain forms of tournament rules. In addition to our main results, this view helps streamline previous analysis of Randomized Single Elimination Bracket, and may be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/07/2019

Approximately Strategyproof Tournament Rules: On Large Manipulating Sets and Cover-Consistence

We consider the manipulability of tournament rules, in which n teams pla...
02/24/2022

Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule

Answering an open question by Betzler et al. [Betzler et al., JAIR'13], ...
05/05/2021

Development of an expected possession value model to analyse team attacking performances in rugby league

This study aimed to provide a framework to evaluate team attacking perfo...
01/29/2021

Probabilistic Inference of Winners in Elections by Independent Random Voters

We investigate the problem of computing the probability of winning in an...
08/01/2022

Robustness of Greedy Approval Rules

We study the robustness of GreedyCC, GreedyPAV, and Phargmen's sequentia...
04/20/2021

Identify, Align, and Integrate: Matching Knowledge Graphs to Commonsense Reasoning Tasks

Integrating external knowledge into commonsense reasoning tasks has show...
06/14/2021

Bandit Modeling of Map Selection in Counter-Strike: Global Offensive

Many esports use a pick and ban process to define the parameters of a ma...