{"title":"A mathematical analysis of fairness in shootouts","authors":"Roel Lambers;Frits C R Spieksma","doi":"10.1093/imaman/dpaa023","DOIUrl":null,"url":null,"abstract":"A shootout is a popular mechanism to identify a winner of a match between two teams. It consists of rounds in which each team gets, sequentially, an opportunity to score a point. It has been shown empirically that shooting first or shooting second in a round has an impact on the scoring probability. This raises a fairness question: is it possible to specify a sequence such that identical teams have equal chance of winning? We show that, for a sudden death, no repetitive sequence can be fair. In addition, we show that the so-called Prohuet–Thue–Morse sequence is not fair. There is, however, an algorithm that outputs a fair sequence whenever one exists. We also analyze the popular best-of-\n<tex>$k$</tex>\n shootouts and show that no fair sequence exists in this situation. In addition, we find explicit expressions for the degree of unfairness in a best-of-\n<tex>$k$</tex>\n shootout; this allows sports administrators to asses the effect of the length of the shootout on the degree of unfairness.","PeriodicalId":56296,"journal":{"name":"IMA Journal of Management Mathematics","volume":"32 4","pages":"411-424"},"PeriodicalIF":1.9000,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1093/imaman/dpaa023","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IMA Journal of Management Mathematics","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/9579140/","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 7
Abstract
A shootout is a popular mechanism to identify a winner of a match between two teams. It consists of rounds in which each team gets, sequentially, an opportunity to score a point. It has been shown empirically that shooting first or shooting second in a round has an impact on the scoring probability. This raises a fairness question: is it possible to specify a sequence such that identical teams have equal chance of winning? We show that, for a sudden death, no repetitive sequence can be fair. In addition, we show that the so-called Prohuet–Thue–Morse sequence is not fair. There is, however, an algorithm that outputs a fair sequence whenever one exists. We also analyze the popular best-of-
$k$
shootouts and show that no fair sequence exists in this situation. In addition, we find explicit expressions for the degree of unfairness in a best-of-
$k$
shootout; this allows sports administrators to asses the effect of the length of the shootout on the degree of unfairness.
期刊介绍:
The mission of this quarterly journal is to publish mathematical research of the highest quality, impact and relevance that can be directly utilised or have demonstrable potential to be employed by managers in profit, not-for-profit, third party and governmental/public organisations to improve their practices. Thus the research must be quantitative and of the highest quality if it is to be published in the journal. Furthermore, the outcome of the research must be ultimately useful for managers. The journal also publishes novel meta-analyses of the literature, reviews of the "state-of-the art" in a manner that provides new insight, and genuine applications of mathematics to real-world problems in the form of case studies. The journal welcomes papers dealing with topics in Operational Research and Management Science, Operations Management, Decision Sciences, Transportation Science, Marketing Science, Analytics, and Financial and Risk Modelling.