The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Automated game balancing of asymmetric video games
Open accessAbstract
Designing a (video) game such that it is balanced - i.e. fair for all players - is a prevailing challenge in game design. Perhaps counter-intuitively, games that are symmetric with respect to (board) design, starting conditions, and the employed action set, are not necessarily fair games. Indeed, perfect play from all players does not automatically lead to a draw, but may probabilistically favour e.g., the first player to move. Even more so, asymmetric games - in which the action set of one player is typically highly distinct from that of another player - are generally unbalanced unless meticulous care has been taken to ensure that the asymmetry in the design does not skew win probabilities. In this context, the present paper contributes a method for automatically balancing the design of asymmetric games. It employs Monte Carlo simulation to analyse the relative impact of game actions, and iteratively adjusts attributes of the game actions till the game design is balanced by approximation. To assess the effectiveness of the proposed method, experiments were performed with automatically balancing a set of tower-defence games. Preliminary experimental results revealed that the proposed method (1) is able to identify the principal component of a game's imbalance, and (2) can automatically adjust the game design till it is balanced by approximation.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Limited work [1,7,15], however, has been published to automatically balance asymmetric games, i.e. players with different abilities and stats.”
From Level the Level: Balancing Game Levels for Asymmetric Player Archetypes With Reinforcement Learning (2025) · cites this paper as [1]
Citations
Cites
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
Bandit Based Monte-Carlo Planning
Kocsis, L., & Szepesvári, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11871842_29 · Cited by 2,855
Games solved: Now and in the future
van den Herik, H. J., Uiterwijk, J. W. H. M., & van Rijswijck, J. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00152-7 · Cited by 256
Kim, J. H., Gunn, D. V., Schuh, E., Phillips, B., Pagulayan, R. J., & Wixon, D. (2008) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1357054.1357126 · Cited by 252
Game Architecture and Design: A New Edition
Rollings, A., & Morris, D. (2003) · Cited by 170
(2013) · Choice Reviews Online · doi:10.5860/choice.50-5038 · Cited by 148
Evaluating Competitive Game Balance with Restricted Play
Jaffe, A., Miller, A., Andersen, E., Liu, Y.-E., Karlin, A. R., & Popović, Z. (2012) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v8i1.12513 · Cited by 79
Evolving card sets towards balancing dominion
Mahlmann, T., Togelius, J., & Yannakakis, G. N. (2012) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2012.6256441 · Cited by 54
Mining game statistics from web services
Lewis, C., & Wardrip–Fruin, N. (2010) · International Conference on the Foundations of Digital Games (FDG) · doi:10.1145/1822348.1822362 · Cited by 50
Game Metrics Without Players: Strategies for Understanding Game Artifacts
Nelson, M. (2011) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v7i3.12479 · Cited by 41
Computational intelligence and tower defence games
Avery, P. M., Togelius, J., Alistar, E., et al. (2011) · doi:10.1109/cec.2011.5949738 · Cited by 37
Using coevolution to understand and validate game balance in continuous games
Leigh, R., Schonfeld, J., & Louis, S. J. (2008) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1389095.1389394 · Cited by 30
Empirical analysis of user data in game software development
Hullett, K., Nagappan, N., Schuh, E., et al. (2012) · Proceedings of the ... ACM-IEEE International Symposium on Empirical Software Engineering and Measurement/International Symposium on Empirical Software Engineering and Measurement · doi:10.1145/2372251.2372265 · Cited by 25
Adapting Game Mechanics with Micro-Machinations
van Rozen, R., & Dormans, J. (2014) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 14
Off with their assists: An empirical study of driving skill in Forza Motorsport 4.
Debeauvais, T., Zimmermann, T., Nagappan, N., et al. (2014) · Foundations of Digital Games · Cited by 7
Adaptive AI to play tower defense game
Rummell, P. A. (2011) · doi:10.1109/cgames.2011.6000357 · Cited by 4
A Multi-agents Coordination Mechanism to Improving Real-time Strategy on Tower Defense Game
Lo, S. K. C., Keh, H., & Chang, C. (2013) · Journal of Applied Sciences · doi:10.3923/jas.2013.683.691 · Cited by 2
Cited by
Level the Level: Balancing Game Levels for Asymmetric Player Archetypes With Reinforcement Learning
Rupp, F., & Eckert, K. (2025) · Proceedings of the 20th International Conference on the Foundations of Digital Games · doi:10.1145/3723498.3723747 · Cited by 1
Metadata
- Authors
- Beau, P., & Bakkes, S.
- Affiliations
- Tilburg University (NL)
- ORCID
- Bakkes, Sander
- Venue
- 2016 IEEE Conference on Computational Intelligence and Games (CIG)
- Publisher
- IEEE
- Published
- 2016-09
- Pages
- 1-8
- OpenAlex
- W2590230674
- Semantic Scholar
- b44ab94aaa162ff99af6138b53044bf7d794d805
- Cited by
- 22
- References
- 17
- Citations by year
- 2025: 6 · 2024: 2 · 2023: 3 · 2022: 3 · 2021: 2 · 2020: 3 · 2019: 1 · 2018: 2
- FWCI
- 0.54
- Type
- conference paper
- Language
- en
- Open access
- Licence
- other-oa
- Locations
- IEEE Conference on Computational Intelligence and Games (CIG) (publishedVersion)
- Data Archiving and Networked Services (DANS) (submittedVersion, other-oa)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
- Social Sciences › Sociology and Political Science › Digital Games and Media
- Social Sciences › Decision Sciences › Management Science and Operations Research › Game Theory and Applications
- Keywords
- game balance, asymmetric games, video games, game design, winning probability, Monte Carlo simulation, fairness
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.