Bandit Modeling of Map Selection in Counter-Strike: Global Offensive
Many esports use a pick and ban process to define the parameters of a match before it starts. In Counter-Strike: Global Offensive (CSGO) matches, two teams first pick and ban maps, or virtual worlds, to play. Teams typically ban and pick maps based on a variety of factors, such as banning maps which they do not practice, or choosing maps based on the team's recent performance. We introduce a contextual bandit framework to tackle the problem of map selection in CSGO and to investigate teams' pick and ban decision-making. Using a data set of over 3,500 CSGO matches and over 25,000 map selection decisions, we consider different framings for the problem, different contexts, and different reward metrics. We find that teams have suboptimal map choice policies with respect to both picking and banning. We also define an approach for rewarding bans, which has not been explored in the bandit setting, and find that incorporating ban rewards improves model performance. Finally, we determine that usage of our model could improve teams' predicted map win probability by up to 11% and raise overall match win probabilities by 19.8% for evenly-matched teams.
Code (0)
등록된 구현이 없습니다.
Tasks
Decision MakingSimilar Papers 제목 키워드 기반
Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezing
We consider the off-policy selection and learning in contextual bandits where the learner aims to select or train a reward-maximizing policy using data collected by a fixed behavior policy. Our contribution is two-fold. …
Multi-Armed BanditsValuing Player Actions in Counter-Strike: Global Offensive
Esports, despite its expanding interest, lacks fundamental sports analytics resources such as accessible data or proven and reproducible analytical frameworks. Even Counter-Strike: Global Offensive (CSGO), the second mos…
Sports AnalyticsWhen and Whom to Collaborate with in a Changing Environment: A Collaborative Dynamic Bandit Solution
Collaborative bandit learning, i.e., bandit algorithms that utilize collaborative filtering techniques to improve sample efficiency in online interactive recommendation, has attracted much research attention as it enjoys…
Bayesian InferenceCollaborative FilteringInteractive RecommendationModel Selection+2Adaptive Operator Selection Based on Dynamic Thompson Sampling for MOEA/D
In evolutionary computation, different reproduction operators have various search dynamics. To strike a well balance between exploration and exploitation, it is attractive to have an adaptive operator selection (AOS) mec…
Thompson SamplingDown to the Last Strike: The Effect of the Jury Lottery on Criminal Convictions
How much does luck matter to a criminal defendant in a jury trial? We use rich data on jury selection to causally estimate how parties who are randomly assigned a less favorable jury (as proxied by whether their attorney…
counterfactual