IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i19p2480-d649698.html
   My bibliography  Save this article

Dynamic Programming Algorithms for Computing Optimal Knockout Tournaments

Author

Listed:
  • Amelia Bădică

    (Department of Statistics and Business Informatics, University of Craiova, 200585 Craiova, Romania)

  • Costin Bădică

    (Department of Computers and Information Technology, University of Craiova, 200585 Craiova, Romania)

  • Ion Buligiu

    (Department of Statistics and Business Informatics, University of Craiova, 200585 Craiova, Romania)

  • Liviu Ion Ciora

    (Department of Statistics and Business Informatics, University of Craiova, 200585 Craiova, Romania)

  • Doina Logofătu

    (Faculty of Computer Science and Engineering, Frankfurt University of Applied Sciences, Nibelungenplatz 1, 60318 Frankfurt am Main, Germany)

Abstract

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 optimal tournaments and we provide its sound complexity analysis. Based on the idea of the dynamic programming approach, we also develop more efficient deterministic and stochastic sub-optimal algorithms. We present experimental results obtained with the Python implementation of all the proposed algorithms regarding the optimality of solutions and the efficiency of the running time.

Suggested Citation

  • Amelia Bădică & Costin Bădică & Ion Buligiu & Liviu Ion Ciora & Doina Logofătu, 2021. "Dynamic Programming Algorithms for Computing Optimal Knockout Tournaments," Mathematics, MDPI, vol. 9(19), pages 1-24, October.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:19:p:2480-:d:649698
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/19/2480/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/19/2480/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Karpov, Alexander, 2015. "A theory of knockout tournament seedings," Working Papers 0600, University of Heidelberg, Department of Economics.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Florin Leon & Mircea Hulea & Marius Gavrilescu, 2022. "Preface to the Special Issue on “Advances in Artificial Intelligence: Models, Optimization, and Machine Learning”," Mathematics, MDPI, vol. 10(10), pages 1-4, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:19:p:2480-:d:649698. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.