Lisa Garcia Tercero , David Van Bulck , Fabien Nießen , Dries Goossens
{"title":"Minimal and fair waiting times for single-day sports tournaments with multiple fields","authors":"Lisa Garcia Tercero , David Van Bulck , Fabien Nießen , Dries Goossens","doi":"10.1016/j.orl.2025.107300","DOIUrl":null,"url":null,"abstract":"<div><div>This paper studies a single-day round-robin sports tournament organized at a single location featuring multiple fields. Teams are fully rested after a certain period of not playing, and all other periods between games are declared as waiting times. Considering both efficiency and fairness regarding waiting times, we prove lower bounds on the total and maximum waiting time and develop polynomial-time algorithms with an absolute performance guarantee of at most 5 for an even number of teams and 1 for an odd number of teams.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107300"},"PeriodicalIF":0.8000,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637725000616","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
Abstract
This paper studies a single-day round-robin sports tournament organized at a single location featuring multiple fields. Teams are fully rested after a certain period of not playing, and all other periods between games are declared as waiting times. Considering both efficiency and fairness regarding waiting times, we prove lower bounds on the total and maximum waiting time and develop polynomial-time algorithms with an absolute performance guarantee of at most 5 for an even number of teams and 1 for an odd number of teams.
期刊介绍:
Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.