English
Related papers

Related papers: Merging Knockout and Round-Robin Tournaments: A Fl…

200 papers

Given a mapping from a set of players to the leaves of a complete binary tree (called a seeding), a knockout tournament is conducted as follows: every round, every two players with a common parent compete against each other, and the winner…

Data Structures and Algorithms · Computer Science 2024-01-24 Juhi Chaudhary , Hendrik Molter , Meirav Zehavi

A knockout tournament is one of the most simple and popular forms of competition. Here, we are given a binary tournament tree where all leaves are labeled with seed position names. The players participating in the tournament are assigned to…

Discrete Mathematics · Computer Science 2025-06-05 Klim Efremenko , Hendrik Molter , Meirav Zehavi

This paper explores a novel way for analyzing the tournament structures to find a best suitable one for the tournament under consideration. It concerns about three aspects such as tournament conducting cost, competitiveness development and…

Artificial Intelligence · Computer Science 2016-11-28 Nhien Pham Hoang Bao , Hiroyuki Iida

Round robin tournaments are omnipresent in sport competitions and beyond. We propose two new integer programming formulations for scheduling a round robin tournament, one of which we call the matching formulation. We analytically compare…

Optimization and Control · Mathematics 2022-10-18 Jasper van Doornmalen , Christopher Hojny , Roel Lambers , Frits C. R. Spieksma

Knockout tournaments, also known as single-elimination or cup tournaments, are a popular form of sports competitions. In the standard probabilistic setting, for each pairing of players, one of the players wins the game with a certain (a…

Data Structures and Algorithms · Computer Science 2024-12-17 Juhi Chaudhary , Hendrik Molter , Meirav Zehavi

Knockout tournaments constitute a popular format for organizing sports competitions. While prior results have shown that it is often possible to manipulate a knockout tournament by fixing the bracket, these results ignore the prevalent…

Computer Science and Game Theory · Computer Science 2023-06-27 Pasin Manurangsi , Warut Suksompong

We consider a random knockout tournament among players $1, \ldots, n$, in which each match involves two players. The match format is specified by the number of matches played in each round, where the constitution of the matches in a round…

Probability · Mathematics 2016-12-15 Ilan Adler , Yang Cao , Richard Karp , Erol Pekoz , Sheldon M. Ross

Tournaments are a widely used mechanism to rank alternatives in a noisy environment. This paper investigates a fundamental issue of economics in tournament design: what is the best usage of limited resources, that is, how should the…

Applications · Statistics 2022-05-24 Balázs R. Sziklai , Péter Biró , László Csató

Single-elimination (SE) tournaments are a popular format used in competitive environments and decision making. Algorithms for SE tournament manipulation have been an active topic of research in recent years. In this paper, we initiate the…

Data Structures and Algorithms · Computer Science 2024-02-12 Sushmita Gupta , M. S. Ramanujan , Peter Strulo

Over the last decade, extensive research has been conducted on the algorithmic aspects of designing single-elimination (SE) tournaments. Addressing natural questions of algorithmic tractability, we identify key properties of input instances…

Data Structures and Algorithms · Computer Science 2024-09-02 Václav Blažej , Sushmita Gupta , M. S. Ramanujan , Peter Strulo

Every sport needs rules. Tournament design refers to the rules that determine how a tournament, a series of games between a number of competitors, is organized. This study aims to provide an overview of the tournament design literature from…

Physics and Society · Physics 2025-05-20 Karel Devriesere , László Csató , Dries Goossens

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

We study the problem of scheduling asynchronous round-robin tournaments. We consider three measures of a schedule that concern the quality and fairness of a tournament. We show that the schedule generated by the well-known "circle design"…

Combinatorics · Mathematics 2018-04-19 Warut Suksompong

A tournament organizer must select one of $n$ possible teams as the winner of a competition after observing all $\binom{n}{2}$ matches between them. The organizer would like to find a tournament rule that simultaneously satisfies the…

Computer Science and Game Theory · Computer Science 2024-07-26 David Mikšaník , Ariel Schvartzman , Jan Soukup

We consider the manipulability of tournament rules which map the results of $\binom{n}{2}$ 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…

Computer Science and Game Theory · Computer Science 2021-01-12 Kimberly Ding , S. Matthew Weinberg

Balanced knockout tournaments are ubiquitous in sports competitions and are also used in decision-making and elections. The traditional computational question, that asks to compute a draw (optimal draw) that maximizes the winning…

Computer Science and Game Theory · Computer Science 2016-04-19 Krishnendu Chatterjee , Rasmus Ibsen-Jensen , Josef Tkadlec

We investigate a new tournament format that consists of a series of individual knockout tournaments; we call this new format a Serial Knockout Competition (SKC). This format has recently been adopted by the Professional Darts Corporation.…

Combinatorics · Mathematics 2022-11-07 Frits Spieksma , Rudi Pendavingh , Roel Lambers

Existing match classification models in the tournament design literature have two major limitations: a contestant is considered indifferent only if uncertain future results do never affect its prize, and competitive matches are not…

Physics and Society · Physics 2026-01-29 László Csató , András Gyimesi

The incomplete round robin sports tournament format, where each team plays the same number of games but faces only a subset of the other teams, is becoming increasingly popular in both youth and professional competitions. In contrast to…

Optimization and Control · Mathematics 2026-05-12 Karel Devriesere , David Van Bulck , Dries Goossens

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ó
‹ Prev 1 2 3 10 Next ›