The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Balancing of competitive two-player Game Levels with Reinforcement Learning
Open accessAbstract
The balancing process for game levels in a competitive two-player context involves a lot of manual work and testing, particularly in non-symmetrical game levels. In this paper, we propose an architecture for automated balancing of tile-based levels within the recently introduced PCGRL framework (procedural content generation via reinforcement learning).Our architecture is divided into three parts: (1) a level generator, (2) a balancing agent and, (3) a reward modeling simulation. By playing the level in a simulation repeatedly, the balancing agent is rewarded for modifying it towards the same win rates for all players. To this end, we introduce a novel family of swap-based representations to increase robustness towards playability. We show that this approach is capable to teach an agent how to alter a level for balancing better and faster than plain PCGRL. In addition, by analyzing the agent’s swapping behavior, we can draw conclusions about which tile types influence the balancing most. We test and show our results using the Neural MMO (NMMO) environment in a competitive two-player setting.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures








Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In a direct comparison, the training using the smaller action space converges faster for all models and allows for higher rewards, resulting in overall better performance, in particular for type A vs. A (cf. Table 1 and also [12,13]).”
From Level the Level: Balancing Game Levels for Asymmetric Player Archetypes With Reinforcement Learning (2025) · cites this paper as [12]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Balancing is considered as a fine-tuning process for existing levels, which has been shown to converge faster as when levels are generated and balanced in a single step [12].”
From Level the Level: Balancing Game Levels for Asymmetric Player Archetypes With Reinforcement Learning (2025) · cites this paper as [12]
The cited source says what the claim attributes to it.
In the citing paper
“This approach is, however, limited by the fact that it only uses exactly the same archetype of agents playing against each other.”
From Level the Level: Balancing Game Levels for Asymmetric Player Archetypes With Reinforcement Learning (2025) · cites this paper as [12]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Proximal Policy Optimization Algorithms
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017) · arXiv · doi:10.48550/arxiv.1707.06347 · Cited by 10,625 · cited 1×
“As RL algorithm, we apply PPO (proximal policy optimization) [28].”
MethodA general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., Lanctot, M., Sifre, L., Kumaran, D., Graepel, T., et al. (2018) · Science · doi:10.1126/science.aar6404 · Cited by 3,562 · cited 1×
“In the games community, RL has been widely applied to play games [20], [21], but recently, it has also been used for PCG [9], [22], [23].”
MethodGrandmaster level in StarCraft II using multi-agent reinforcement learning
Vinyals, O., Babuschkin, I., Czarnecki, W. M., Mathieu, M., Dudzik, A., Chung, J., Choi, D. H., Powell, R., Ewalds, T., Georgiev, P., et al. (2019) · Nature · doi:10.1038/s41586-019-1724-z · Cited by 3,455
(1978) · Medical Entomology and Zoology · Cited by 1,199
Search-Based Procedural Content Generation: A Taxonomy and Survey
Togelius, J., Yannakakis, G. N., Stanley, K. O., & Browne, C. (2011) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2011.2148116 · Cited by 706
Procedural Content Generation via Machine Learning (PCGML)
Summerville, A., Snodgrass, S., Guzdial, M., Holmgard, C., Hoover, A. K., Isaksen, A., Nealen, A., & Togelius, J. (2018) · IEEE Transactions on Games · doi:10.1109/tg.2018.2846639 · Cited by 425
Deep learning for procedural content generation
Liu, J., Snodgrass, S., Khalifa, A., Risi, S., Yannakakis, G. N., & Togelius, J. (2020) · Neural Computing and Applications · doi:10.1007/s00521-020-05383-8 · Cited by 245
PCGRL: Procedural Content Generation via Reinforcement Learning
Khalifa, A., Bontrager, P., Earle, S., & Togelius, J. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v16i1.7416 · Cited by 156
Neural MMO: A Massively Multiagent Game Environment for Training and Evaluating Intelligent AgentsPreprint
Suárez, J., Du, Y., Isola, P., & Mordatch, I. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.00784 · Cited by 113
Dynamic Game Balancing: an Evaluation of User Satisfaction
de Andrade, G. D., Ramalho, G. L., Gomes, A. S., & Corruble, V. (2006) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v2i1.18739 · Cited by 89
Research works printed but not linked: 1
- Mojang, 2011, Mincraft
Cited by
Simulation-Driven Balancing of Competitive Game Levels With Reinforcement Learning
Rupp, F., Eberhardinger, M., & Eckert, K. (2024) · IEEE Transactions on Games · doi:10.1109/tg.2024.3399536 · Cited by 11
Self-citationTan, W., & Huang, D. (2024) · IEEE Access · doi:10.1109/access.2024.3435949 · Cited by 10
The Trick is to Stay Behind?: Defining and Exploring the Design Space of Player Balancing Mechanics
Gonçalves, D., Barros, D., Pais, P., Guerreiro, J., Guerreiro, T., & Rodrigues, A. (2024) · CHI Conference on Human Factors in Computing Systems · doi:10.1145/3613904.3642441 · Cited by 9
GEEvo: Game Economy Generation and Balancing with Evolutionary Algorithms
Rupp, F., & Eckert, K. (2024) · 2024 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec60901.2024.10612054 · Cited by 7
Self-citationG-PCGRL: Procedural Graph Data Generation via Reinforcement Learning
Rupp, F., & Eckert, K. (2024) · IEEE Conference on Games (CoG) · doi:10.1109/cog60054.2024.10645633 · Cited by 6
Self-citation
Metadata
- Authors
- Rupp, F., Eberhardinger, M., & Eckert, K.
- Affiliations
- Technische Hochschule Mannheim (DE)
- Stuttgart Media University (DE)
- Venue
- 2023 IEEE Conference on Games (CoG)
- Publisher
- IEEE
- Published
- 2023-08-21
- Pages
- 1-8
- OpenAlex
- W4389296253
- Semantic Scholar
- 7d1f7d0ff9c2728c2cd1f172420fd3230cbe8f1e
- Cited by
- 10
- References
- 27
- Citations by year
- 2026: 1 · 2025: 2 · 2024: 7
- FWCI
- 1.78
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Conference on Games (CoG) (publishedVersion)
- arXiv (Cornell University) (submittedVersion, cc-by)
- arXiv (Cornell University) (cc-by)
- Funders
- Volkswagen Foundation
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Social Sciences › Sociology and Political Science › Digital Games and Media
- Keywords
- procedural content generation, reinforcement learning, reward modeling
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Balancing of competitive two-player Game Levels with Reinforcement Learning. https://app.cochat.ai/papers/10.1109/cog57401.2023.10333248
- The paper
- Rupp, F., Eberhardinger, M., & Eckert, K. (2023). Balancing of competitive two-player Game Levels with Reinforcement Learning. 2023 IEEE Conference on Games (CoG). https://doi.org/10.1109/cog57401.2023.10333248
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.