Dungeons & Replicants: Automated Game Balancing via Deep Player Behavior Modeling
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Balancing the options available to players in a way that ensures rich variety and viability is a vital factor for the success of any video game, and particularly competitive multiplayer games. Traditionally, this balancing act requires extensive periods of expert analysis, play testing and debates. While automated gameplay is able to predict outcomes of parameter changes, current approaches mainly rely on heuristic or optimal strategies to generate agent behavior. In this paper, we demonstrate the use of deep player behavior models to represent a player population (n = 213) of the massively multiplayer online role-playing game Aion, which are used, in turn, to generate individual agent behaviors. Results demonstrate significant balance differences in opposing enemy encounters and show how these can be regulated. Moreover, the analytic methods proposed are applied to identify the balance relationships between classes when fighting against each other, reflecting the original developers' design.
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
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.
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
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
Grandmaster 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
Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm
Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., Lanctot, M., Sifre, L., Kumaran, D., Graepel, T., et al. (2017) · arXiv · doi:10.48550/arxiv.1712.01815 · Cited by 1,102 · cited 1×
“in Atari games [11], classical board games such as chess, shōgi and Go [12], [13] or real-time strategy games (RTS) such as StarCraft II [14].”
BackgroundArtificial Intelligence and Games
Yannakakis, G. N., & Togelius, J. (2018) · doi:10.1007/978-3-319-63519-4 · Cited by 511
Self-citationAutomated Playtesting With Procedural Personas Through MCTS With Evolved Heuristics
Holmgard, C., Green, M. C., Liapis, A., & Togelius, J. (2019) · IEEE Transactions on Games · doi:10.1109/tg.2018.2808198 · Cited by 125
Self-citationHuman-Like Playtesting with Deep Learning
Gudmundsson, S. F., Eisen, P., Poromaa, E., Nodet, A., Purmonen, S., Kozakowski, B., Meurling, R., & Cao, L. (2018) · 2018 IEEE Conference on Computational Intelligence and Games (CIG) · doi:10.1109/cig.2018.8490442 · Cited by 90 · cited 1×
“[41] utilized atomic choices in order to predict the difficulty of various levels of a Match-3-Puzzle game.”
Method(2017) · doi:10.1145/3130859.3131439 · Cited by 56 · cited 2×
“While automated routines for the detection and reporting of critical errors and solvability become more popular in the industry [3], [4], balancing remains one of the most difficult and time-consuming phases of the game design process.”
BackgroundSelf-citationDeep Player Behavior Models: Evaluating a Novel Take on Dynamic Difficulty Adjustment
Pfau, J., Smeddinck, J. D., & Malaka, R. (2019) · Extended Abstracts of the 2019 CHI Conference on Human Factors in Computing Systems · doi:10.1145/3290607.3312899 · Cited by 17 · cited 1×
“It was trained over 1000 epochs, based on insights from previous work [16]–[18], [42]; benchmarks prior to the study also indicated diminishing returns when further increasing the range of parameters.”
MethodSelf-citationSemi-automated level design via auto-playtesting for handheld casual game creation
Powley, E. J., Colton, S., Gaudl, S., Saunders, R., & Nelson, M. J. (2016) · 2016 IEEE Conference on Computational Intelligence and Games (CIG) · doi:10.1109/cig.2016.7860438 · Cited by 14 · cited 1×
“A number of studies tackle solvability, such as those of Powley et al. [27], Shaker et al. [28] or Volkmar et al. [29] that aided the level design of (procedurally generated) games by assuring potential solutions are feasible.”
Background
Cited by
(2020) · doi:10.1145/3383668.3419905 · Cited by 15
Self-citationSimulation-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
“Pfau et al. [17] trained models with data from played games to replicate human behavior for automated entity balancing.”
Balancing of competitive two-player Game Levels with Reinforcement Learning
Rupp, F., Eberhardinger, M., & Eckert, K. (2023) · 2023 IEEE Conference on Games (CoG) · doi:10.1109/cog57401.2023.10333248 · Cited by 10
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
Playing the System: Can Puzzle Players Teach us How to Solve Hard Problems?
Mutalova, R., Sarrazin-Gendron, R., Cai, E., Richard, G., Ghasemloo Gheidari, P., Caisse, S., Knight, R., Blanchette, M., Szantner, A., & Waldispühl, J. (2023) · Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems · doi:10.1145/3544548.3581375 · Cited by 6
Metadata
- Authors
- Pfau, J., Liapis, A., Volkmar, G., Yannakakis, G. N., & Malaka, R.
- Venue
- 2020 IEEE Conference on Games (CoG)
- Publisher
- IEEE
- Published
- 2020-08
- Pages
- 431-438
- OpenAlex
- W3093621925
- Cited by
- 48
- References
- 9
- FWCI
- 2.72
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Dungeons & Replicants: Automated Game Balancing via Deep Player Behavior Modeling. https://app.cochat.ai/papers/10.1109/cog47356.2020.9231958
- The paper
- Pfau, J., Liapis, A., Volkmar, G., Yannakakis, G. N., & Malaka, R. (2020). Dungeons & Replicants: Automated Game Balancing via Deep Player Behavior Modeling. 2020 IEEE Conference on Games (CoG). https://doi.org/10.1109/cog47356.2020.9231958
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.