Abstract Electronic sports tournaments are well adapted to dynamic scheduling. A dynamic approach for scheduling e-sports tournaments based on a modification of the Swiss system design is proposed. We use Colley’s method to update all competitors’ ratings at every round. The ratings are used for maximizing game fairness and viewers’ utility in the integer programming formulation of the team pairing and game scheduling problem solved at each round. The approach was validated using real-life data from the 2020 Honor of Kings World Champion Cup group stage and further evaluated using randomly generated test problems with up to 80 competitors, illustrating the approach’s applicability.

    Highlights Good schedules play a vital role in a sports tournament. Electronic sports tournaments are adapted to dynamic scheduling. Dynamic scheduling is based on the Swiss system tournament design. First application of optimization methods to the scheduling of esports tournaments. Integer programming is used at each round for team pairing and game scheduling.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Dynamic scheduling of e-sports tournaments


    Contributors:
    Dong, Zhi-Long (author) / Ribeiro, Celso C. (author) / Xu, Fengmin (author) / Zamora, Ailec (author) / Ma, Yujie (author) / Jing, Kui (author)


    Publication date :

    2022-12-03




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English