IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2610.05251.html

What a Shorter Contest Really Costs: Serial Dependence, Effective Trials, and Evidence from a Rule Change in Professional Esports

Author

Listed:
  • Petr Parshakov

Abstract

Operational research evaluates tournament formats by their efficacy, the probability that the design identifies the stronger competitor, and computes it almost exclusively by simulation under an assumption that is rarely tested: that the trials a format aggregates are independent. We show that this assumption systematically overstates what shortening a contest costs, and we measure the correction. When trials are serially correlated, a format carries N/[1+(N-1)rho] effective trials rather than N, so a twenty per cent cut costs 10.6 per cent of discriminating power under independence but only 5.2 per cent at the correlation we estimate, and only 2.1 per cent in a sixty-trial format. The ingredients are estimated from an implemented change in contest length: in September 2023 professional Counter-Strike cut regulation rounds per map from thirty to twenty-four. Across 72,576 maps we measure discrimination as the ability slope over the residual standard deviation on the first half of a map, a contest fixed by rule at fifteen or twelve rounds with no stopping rule. Against the calibrated benchmark of 0.948, discrimination falls by thirty-five per cent in a ten-month window around the switch (0.648, 95 per cent interval 0.52-0.81) and by ten per cent over the full panel (0.901, 0.82-0.99). The correction needs one number, recoverable from ordinary results data as a design effect.

Suggested Citation

  • Petr Parshakov, 2026. "What a Shorter Contest Really Costs: Serial Dependence, Effective Trials, and Evidence from a Rule Change in Professional Esports," Papers 2610.05251, arXiv.org.
  • Handle: RePEc:arx:papers:2610.05251
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2610.05251
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:arx:papers:2610.05251. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    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.