Computational Game Unit Balancing based on Game Theory
Optimizing game elements through iterative human playtests can be time-consuming and insufficient for games with complex intransitive mechanics. Imbalances in games often require the release of numerous balance patches. We present a computational method for making each game unit equally preferable a...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Graz University of Technology
2025-01-01
|
| Series: | Journal of Universal Computer Science |
| Subjects: | |
| Online Access: | https://lib.jucs.org/article/121185/download/pdf/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832581888107085824 |
|---|---|
| author | Emre Önal Abdullah Bülbül |
| author_facet | Emre Önal Abdullah Bülbül |
| author_sort | Emre Önal |
| collection | DOAJ |
| description | Optimizing game elements through iterative human playtests can be time-consuming and insufficient for games with complex intransitive mechanics. Imbalances in games often require the release of numerous balance patches. We present a computational method for making each game unit equally preferable against a uniform play strategy. We leverage concepts from game theory to model intricate relationships among intransitive entities. Matching units against each other is modeled as a symmetric zero-sum game, where unit selection represents a strategy and the error is quantified using payoff values derived from unit parameters. The algorithm takes the initial unit parameters provided by the game designer and optimizes them with minimal changes using gradient descent. Consequently, the payoff matrix converges to a state where a uniform strategy is a near Nash equilibrium, ensuring that each unit is equally preferable under the optimized condition. We implemented a testing environment based on fictitious play and verified our results on different scenarios. While the majority of game theory research focuses on finding optimal strategies given specific environmental conditions, this paper takes a different perspective within the context of game design. We explore game theoretic concepts to address the goal of designing environments that lead to desired strategy choices. |
| format | Article |
| id | doaj-art-3b46154a7ae848a98475c90b52240564 |
| institution | Kabale University |
| issn | 0948-6968 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | Graz University of Technology |
| record_format | Article |
| series | Journal of Universal Computer Science |
| spelling | doaj-art-3b46154a7ae848a98475c90b522405642025-01-30T08:31:22ZengGraz University of TechnologyJournal of Universal Computer Science0948-69682025-01-0131132110.3897/jucs.121185121185Computational Game Unit Balancing based on Game TheoryEmre Önal0Abdullah Bülbül1Ankara Yıldırım Beyazıt UniversityAnkara Yıldırım Beyazıt UniversityOptimizing game elements through iterative human playtests can be time-consuming and insufficient for games with complex intransitive mechanics. Imbalances in games often require the release of numerous balance patches. We present a computational method for making each game unit equally preferable against a uniform play strategy. We leverage concepts from game theory to model intricate relationships among intransitive entities. Matching units against each other is modeled as a symmetric zero-sum game, where unit selection represents a strategy and the error is quantified using payoff values derived from unit parameters. The algorithm takes the initial unit parameters provided by the game designer and optimizes them with minimal changes using gradient descent. Consequently, the payoff matrix converges to a state where a uniform strategy is a near Nash equilibrium, ensuring that each unit is equally preferable under the optimized condition. We implemented a testing environment based on fictitious play and verified our results on different scenarios. While the majority of game theory research focuses on finding optimal strategies given specific environmental conditions, this paper takes a different perspective within the context of game design. We explore game theoretic concepts to address the goal of designing environments that lead to desired strategy choices.https://lib.jucs.org/article/121185/download/pdf/Game balancegame theoryNash equilibriumparam |
| spellingShingle | Emre Önal Abdullah Bülbül Computational Game Unit Balancing based on Game Theory Journal of Universal Computer Science Game balance game theory Nash equilibrium param |
| title | Computational Game Unit Balancing based on Game Theory |
| title_full | Computational Game Unit Balancing based on Game Theory |
| title_fullStr | Computational Game Unit Balancing based on Game Theory |
| title_full_unstemmed | Computational Game Unit Balancing based on Game Theory |
| title_short | Computational Game Unit Balancing based on Game Theory |
| title_sort | computational game unit balancing based on game theory |
| topic | Game balance game theory Nash equilibrium param |
| url | https://lib.jucs.org/article/121185/download/pdf/ |
| work_keys_str_mv | AT emreonal computationalgameunitbalancingbasedongametheory AT abdullahbulbul computationalgameunitbalancingbasedongametheory |