mlsanityData to 7 Oct 2026

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

arXiv 2203.12011 ↗First posted 22 Mar 2022cs.GT cs.DM cs.LGcited by 0

Not on the map. Why?

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.

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

Builds on

12 of 89 references.

References · 12

  1. 2021Generalized Huber Loss for Robust Learning and its Efficient Minimization for a Robust Statisticscited by 32
  2. 2018Sequential Outlier Detection based on Incremental Decision Treescited by 21
  3. 2021Optimally Efficient Sequential Calibration of Binary Classifiers to Minimize Classification Errorcited by 17
  4. 2021Nonparametric Extrema Analysis in Time Series for Envelope Extraction, Peak Detection and Clusteringcited by 12
  5. 2022Low Regret Binary Sampling Method for Efficient Global Optimization of Univariate Functionscited by 11
  6. 2022Nonconvex Extension of Generalized Huber Loss for Robust Learning and Pseudo-Mode Statisticscited by 8
  7. 2021Efficient, Anytime Algorithms for Calibration with Isotonic Regression under Strictly Convex Lossescited by 5
  8. 2021Efficient Locally Optimal Number Set Partitioning for Scheduling, Allocation and Fair Selectioncited by 4
  9. 2021A Quadratic Time Locally Optimal Algorithm for NP-hard Equal Cardinality Partition Optimizationcited by 3
  10. 2019Revenue allocation in Formula One: a pairwise comparison approachcited by 2
  11. 2022A Linearithmic Time Locally Optimal Algorithm for the Multiway Number Partition Optimizationcited by 2
  12. 2022Natural Hierarchical Cluster Analysis by Nearest Neighbors with Near-Linear Time Complexitycited by 1

Built on by

Not cited yet.