Optimal knockout tournaments: definition and computation

DOI10.1007/978-3-030-97549-4_25zbMATH Open1490.90299OpenAlexW4225630761MaRDI QIDQ2128447FDOQ2128447

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

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

zbMATH Keywords

optimizationdynamic programmingalgorithm complexityknockout tournament

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Bayesian locally optimal design of knockout tournaments
• Multiple-elimination knockout tournaments with the fixed-win property
• Phylourny: efficiently calculating elimination tournament win probabilities via phylogenetic methods
• Comparing Draws for Single Elimination Tournaments
• Non-parametric procedure for knockout tournaments
• Title not available (Why is that?)
• Designing fair 8- and 16-team knockout tournaments
• 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)