Manipulating Tournaments in Cup and Round Robin Competitions

11/09/2009
by   Tyrel Russell, et al.
0

In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the most popular types of sporting competitions in polynomial time. In addition, we show that finding the minimal number of games that need to be thrown to manipulate the result can also be determined in polynomial time. Finally, we show that there are several different variations of standard cup competitions where manipulation remains polynomial.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/03/2018

Computing the Nucleolus of Weighted Voting Games in Pseudo-polynomial Time

We provide an algorithm for computing the nucleolus for an instance of a...
research
08/22/2022

Reachability Games and Parity Games

Parity games are positionally determined. This is a fundamental and clas...
research
04/08/2019

A Manifold of Polynomial Time Solvable Bimatrix Games

This paper identifies a manifold in the space of bimatrix games which co...
research
05/08/2018

Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems

We give a direct polynomial-time reduction from parity games played over...
research
06/14/2019

Bspline solids manipulation with Mathematica

Bspline solids are used for solid objects modeling in R3. Mathematica in...
research
06/08/2022

How to prevent collusion created by tie-breaking rules

Games played in the last round of a round-robin tournament inspire match...
research
05/05/2018

Designing the Game to Play: Optimizing Payoff Structure in Security Games

Effective game-theoretic modeling of defender-attacker behavior is becom...

Please sign up or login with your details

Forgot password? Click here to reset