English
Related papers

Related papers: How to Make Knockout Tournaments More Popular?

200 papers

Multi-stage tournaments consisting of a round-robin group stage followed by a knockout phase are ubiquitous in sports. However, this format is incentive incompatible if at least two teams from a group advance to the knockout stage where the…

Physics and Society · Physics 2025-01-07 László Csató

Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out…

Computer Science and Game Theory · Computer Science 2020-02-18 Christian Saile , Warut Suksompong

A \emph{fair competition}, based on the concept of envy-freeness, is a non-eliminating competition where each contestant (team or individual player) may not play against all other contestants, but the total difficulty for each contestant is…

Data Structures and Algorithms · Computer Science 2021-02-09 Siddharth Gupta , Meirav Zehavi

Ranking is a ubiquitous phenomenon in the human society. By clicking the web pages of Forbes, you may find all kinds of rankings, such as world's most powerful people, world's richest people, top-paid tennis stars, and so on and so forth.…

Data Analysis, Statistics and Probability · Physics 2015-06-03 Weibing Deng , Wei Li , Xu Cai , Alain Bulou , Qiuping A. Wang

The outcome of some football matches has benefited both teams at the expense of a third team because head-to-head results were used for breaking ties. Inspired by these examples, our mathematical analysis identifies all possible collusion…

Physics and Society · Physics 2025-05-20 László Csató

Consider a round-robin tournament on n teams, where a winner must be (possibly randomly) selected as a function of the results from the ${n \choose 2}$ pairwise matches. A tournament rule is said to be k-SNM-${\alpha}$ if no set of k teams…

Computer Science and Game Theory · Computer Science 2023-01-20 Atanas Dinev , S. Matthew Weinberg

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…

Artificial Intelligence · Computer Science 2012-04-18 Tyrel Russell , Toby Walsh

If the final position of a team is already secured independently of the outcomes of the remaining games in a round-robin tournament, it might play with little enthusiasm. This is detrimental to attendance and can inspire collusion and…

Physics and Society · Physics 2023-02-03 László Csató

This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The extra group structure makes possible to easily derive some very general results characterizing…

Quantum Physics · Physics 2025-03-14 Theodore Andronikos

The group draw of a sports tournament requires assigning teams to groups of (almost) the same size. The most important criteria for a draw procedure are balance, randomness, and transparency, which could not be satisfied simultaneously if…

Physics and Society · Physics 2026-05-25 László Csató

Several sports tournaments contain a round-robin group stage where the teams are assigned to groups subject to some constraints. Hence, the organisers usually use a computer-assisted random draw to avoid any dead end, a situation when the…

Physics and Society · Physics 2025-04-02 László Csató

A directed graph where there is exactly one edge between every pair of vertices is called a {\em tournament}. Finding the "best" set of vertices of a tournament is a well studied problem in social choice theory. A {\em tournament solution}…

Data Structures and Algorithms · Computer Science 2024-01-30 Arnab Maiti , Palash Dey

Tanking, the act of deliberately dropping points or losing a game in order to gain some other advantage, is usually seen as being against the spirit of sports. It can be even more serious if playing a draw is a (weakly) dominant strategy…

Physics and Society · Physics 2020-08-26 László Csató

Motivated by applications to word-of-mouth advertising, we consider a game-theoretic scenario in which competing advertisers want to target initial adopters in a social network. Each advertiser wishes to maximize the resulting cascade of…

Computer Science and Game Theory · Computer Science 2014-03-26 Allan Borodin , Mark Braverman , Brendan Lucier , Joel Oren

A fundamental result in cake cutting states that for any number of players with arbitrary preferences over a cake, there exists a division of the cake such that every player receives a single contiguous piece and no player is left envious.…

Theoretical Economics · Economics 2023-03-20 Erel Segal-Halevi , Warut Suksompong

Crucial to an Evolutionary Algorithm's performance is its selection scheme. We mathematically investigate the relation between polynomial rank and probabilistic tournament methods which are (respectively) generalisations of the popular…

Neural and Evolutionary Computing · Computer Science 2008-06-26 Kassel Hingee , Marcus Hutter

We introduce a novel system of matching and scoring players in tournaments, called Multi-Tier Tournaments, illustrated by chess and based on the following rules: 1. Players are divided into skill-based tiers, based on their Elo ratings. 2.…

Theoretical Economics · Economics 2024-07-22 Steven J. Brams , Mehmet S. Ismail

Boxing has a long-standing problem with biased judging, impacting both professional and Olympic bouts. "Robberies", where boxers are widely seen as being denied rightful victories, threaten to drive fans and athletes away from the sport. To…

General Economics · Economics 2024-06-28 Stuart Baumann , Carl Singleton

We consider the recently introduced knotting-unknotting game, in which two players take turns resolving crossings in a knot diagram which initially is missing all its crossing information. Once the knot is fully resolved, the winner is…

Combinatorics · Mathematics 2011-07-25 William Johnson

Tournaments are widely used models to represent pairwise dominance between candidates, alternatives, or teams. We study the problem of providing certified explanations for why a candidate appears among the winners under various tournament…

Artificial Intelligence · Computer Science 2026-01-22 Clément Contet , Umberto Grandi , Jérôme Mengin