Dynamic Programming Algorithms for Computing Optimal Knockout Tournaments

Dynamic Programming Algorithms for Computing Optimal Knockout Tournaments

We study competitions structured as hierarchically shaped single-elimination tournaments. We define optimal tournaments by maximizing attractiveness such that the topmost players will have the chance to meet in higher stages of the tournament. We propose a dynamic programming algorithm for computing...

Full description

Bibliographic Details
Main Authors: Amelia Bădică, Costin Bădică, Ion Buligiu, Liviu Ion Ciora, Doina Logofătu
Format: Article
Language:English
Published: MDPI AG 2021-10-01
Series:Mathematics
Subjects:
optimization
knockout tournament
dynamic programming algorithm
computational complexity
combinatorics
Online Access:https://www.mdpi.com/2227-7390/9/19/2480

Internet

https://www.mdpi.com/2227-7390/9/19/2480

Similar Items