Optimal knockout tournaments: definition and computation

DOI10.1007/978-3-030-97549-4_25MaRDI QIDQ2128447zbMATH OpenOpenAlexFDO

Authors Amelia Bădică, Costin Bădică, Ion Buligiu, Liviu Ion Ciora, Doina Logofătu

Publication date 22 April 2022

Full work available at URL https://doi.org/10.1007/978-3-030-97549-4_25

zbMATH Keywords

algorithm complexitydynamic programmingknockout tournamentoptimization

Mathematics Subject Classification ID

Dynamic programming (90C39) Applications of mathematical programming (90C90)

Recommendations

• Fixing balanced knockout and double elimination tournaments
• scientific article; zbMATH DE number 3907559
• Optimal seedings in elimination tournaments
• Competitive intensity and quality maximizing seedings in knock-out tournaments
• Designing fair 8- and 16-team knockout tournaments

Cites work

• On most effective tournament plans with fewer games than competitors
• Probabilistic Completion of a Knockout Tournament
• The early history of the factorial function

Cited in

(12)

• Competitive intensity and quality maximizing seedings in knock-out tournaments
• Fixing balanced knockout and double elimination tournaments
• Multiple-elimination knockout tournaments with the fixed-win property
• Bayesian locally optimal design of knockout tournaments
• scientific article; zbMATH DE number 1003289 (Why is no real title available?)
• Comparing Draws for Single Elimination Tournaments
• scientific article; zbMATH DE number 3907559 (Why is no real title available?)
• Non-parametric procedure for knockout tournaments
• Designing fair 8- and 16-team knockout tournaments
• Phylourny: efficiently calculating elimination tournament win probabilities via phylogenetic methods
• Optimal seedings in elimination tournaments
• Knockout tournaments with diluted Bradley-Terry preference schemes

This page was built for publication: Optimal knockout tournaments: definition and computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128447)