# Merging Knockout and Round-Robin Tournaments: A Flexible Linear Elimination Tournament Design

arXiv: https://arxiv.org/abs/2203.12011 · HTML: https://mlsanity.com/paper/2203.12011/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 12 of its 89 references that are in the map.
- First posted on arXiv 22 Mar 2022.

## Builds on (most cited first, 12 of 12)

- [Generalized Huber Loss for Robust Learning and its Efficient Minimization for a Robust Statistics](https://mlsanity.com/paper/2108.12627/) (2021)
- [Sequential Outlier Detection based on Incremental Decision Trees](https://mlsanity.com/paper/1803.03674/) (2018)
- [Optimally Efficient Sequential Calibration of Binary Classifiers to Minimize Classification Error](https://mlsanity.com/paper/2108.08780/) (2021)
- [Nonparametric Extrema Analysis in Time Series for Envelope Extraction, Peak Detection and Clustering](https://mlsanity.com/paper/2109.02082/) (2021)
- [Low Regret Binary Sampling Method for Efficient Global Optimization of Univariate Functions](https://mlsanity.com/paper/2201.07164/) (2022)
- [Nonconvex Extension of Generalized Huber Loss for Robust Learning and Pseudo-Mode Statistics](https://mlsanity.com/paper/2202.11141/) (2022)
- [Efficient, Anytime Algorithms for Calibration with Isotonic Regression under Strictly Convex Losses](https://mlsanity.com/paper/2111.00468/) (2021)
- [Efficient Locally Optimal Number Set Partitioning for Scheduling, Allocation and Fair Selection](https://mlsanity.com/paper/2109.04809/) (2021)
- [A Quadratic Time Locally Optimal Algorithm for NP-hard Equal Cardinality Partition Optimization](https://mlsanity.com/paper/2109.07882/) (2021)
- [Revenue allocation in Formula One: a pairwise comparison approach](https://mlsanity.com/paper/1909.12931/) (2019)
- [A Linearithmic Time Locally Optimal Algorithm for the Multiway Number Partition Optimization](https://mlsanity.com/paper/2203.05618/) (2022)
- [Natural Hierarchical Cluster Analysis by Nearest Neighbors with Near-Linear Time Complexity](https://mlsanity.com/paper/2203.08027/) (2022)

## Abstract (arXiv)

We propose a new tournament structure that combines the popular knockout tournaments and the round-robin tournaments. As opposed to the extremes of divisive elimination and no elimination, our tournament aims to eliminate the participants as linearly as possible as a form of subtractive elimination. Our design is flexible in the sense that it can be adapted to any number of players N and any number of matches M. Our design satisfies many properties that are desirable for a tournament to select a winner and can be adapted to rank all the participating players.