Metagame Autobalancing for Competitive Multiplayer Games

• URL: http://arxiv.org/abs/2006.04419v1
• Date: Mon, 8 Jun 2020 08:55:30 GMT
• Title: Metagame Autobalancing for Competitive Multiplayer Games
• Authors: Daniel Hernandez, Charles Takashi Toyin Gbadamosi, James Goodman, James Alfred Walker
• Abstract summary: We present a tool for balancing multi-player games during game design. Our approach requires a designer to construct an intuitive graphical representation of their meta-game target. We show the capabilities of this tool on examples inheriting from Rock-Paper-Scissors, and on a more complex asymmetric fighting game.
• Score: 0.10499611180329801
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Automated game balancing has often focused on single-agent scenarios. In this paper we present a tool for balancing multi-player games during game design. Our approach requires a designer to construct an intuitive graphical representation of their meta-game target, representing the relative scores that high-level strategies (or decks, or character types) should experience. This permits more sophisticated balance targets to be defined beyond a simple requirement of equal win chances. We then find a parameterization of the game that meets this target using simulation-based optimization to minimize the distance to the target graph. We show the capabilities of this tool on examples inheriting from Rock-Paper-Scissors, and on a more complex asymmetric fighting game.

Related papers

• Identifying and Clustering Counter Relationships of Team Compositions in PvP Games for Efficient Balance Analysis [24.683917771144536]
  We develop measures to quantify balance in zero-sum competitive scenarios. We identify useful categories of compositions and pinpoint their counter relationships. Our framework has been validated in popular online games, including Age of Empires II, Hearthstone, Brawl Stars, and League of Legends.
  arXiv  Detail & Related papers  (2024-08-30T10:28:36Z)
• Securing Equal Share: A Principled Approach for Learning Multiplayer Symmetric Games [21.168085154982712]
  equilibria in multiplayer games are neither unique nor non-exploitable. This paper takes an initial step towards addressing these challenges by focusing on the natural objective of equal share. We design a series of efficient algorithms, inspired by no-regret learning, that provably attain approximate equal share across various settings.
  arXiv  Detail & Related papers  (2024-06-06T15:59:17Z)
• All by Myself: Learning Individualized Competitive Behaviour with a Contrastive Reinforcement Learning optimization [57.615269148301515]
  In a competitive game scenario, a set of agents have to learn decisions that maximize their goals and minimize their adversaries' goals at the same time. We propose a novel model composed of three neural layers that learn a representation of a competitive game, learn how to map the strategy of specific opponents, and how to disrupt them. Our experiments demonstrate that our model achieves better performance when playing against offline, online, and competitive-specific models, in particular when playing against the same opponent multiple times.
  arXiv  Detail & Related papers  (2023-10-02T08:11:07Z)
• Balancing of competitive two-player Game Levels with Reinforcement Learning [0.2793095554369281]
  We propose an architecture for automated balancing of tile-based levels within the recently introduced PCGRL framework. Our architecture is divided into three parts: (1) a level generator, (2) a balancing agent and, (3) a reward modeling simulation. We show that this approach is capable to teach an agent how to alter a level for balancing better and faster than plain PCGRL.
  arXiv  Detail & Related papers  (2023-06-07T13:40:20Z)
• Finding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks [83.28949556413717]
  We study the problem of computing an approximate Nash equilibrium of continuous-action game without access to gradients. We model players' strategies using artificial neural networks. This paper is the first to solve general continuous-action games with unrestricted mixed strategies and without any gradient information.
  arXiv  Detail & Related papers  (2022-11-29T05:16:41Z)
• Learning Correlated Equilibria in Mean-Field Games [62.14589406821103]
  We develop the concepts of Mean-Field correlated and coarse-correlated equilibria. We show that they can be efficiently learnt in emphall games, without requiring any additional assumption on the structure of the game.
  arXiv  Detail & Related papers  (2022-08-22T08:31:46Z)
• How and Why to Manipulate Your Own Agent [5.634825161148484]
  We consider strategic settings where several users engage in a repeated online interaction, assisted by regret-minimizing agents that repeatedly play a "game" on their behalf. We study the dynamics and average outcomes of the repeated game of the agents, and view it as inducing a meta-game between the users.
  arXiv  Detail & Related papers  (2021-12-14T18:35:32Z)
• Generating Diverse and Competitive Play-Styles for Strategy Games [58.896302717975445]
  We propose Portfolio Monte Carlo Tree Search with Progressive Unpruning for playing a turn-based strategy game (Tribes) We show how it can be parameterized so a quality-diversity algorithm (MAP-Elites) is used to achieve different play-styles while keeping a competitive level of play. Our results show that this algorithm is capable of achieving these goals even for an extensive collection of game levels beyond those used for training.
  arXiv  Detail & Related papers  (2021-04-17T20:33:24Z)
• Deep Policy Networks for NPC Behaviors that Adapt to Changing Design Parameters in Roguelike Games [137.86426963572214]
  Turn-based strategy games like Roguelikes, for example, present unique challenges to Deep Reinforcement Learning (DRL) We propose two network architectures to better handle complex categorical state spaces and to mitigate the need for retraining forced by design decisions.
  arXiv  Detail & Related papers  (2020-12-07T08:47:25Z)
• Imagining Grounded Conceptual Representations from Perceptual Information in Situated Guessing Games [83.53942719040576]
  In visual guessing games, a Guesser has to identify a target object in a scene by asking questions to an Oracle. Existing models fail to learn truly multi-modal representations, relying instead on gold category labels for objects in the scene both at training and inference time. We introduce a novel "imagination" module based on Regularized Auto-Encoders, that learns context-aware and category-aware latent embeddings without relying on category labels at inference time.
  arXiv  Detail & Related papers  (2020-11-05T15:42:29Z)
• Equilibria for Games with Combined Qualitative and Quantitative Objectives [15.590197778287616]
  We study concurrent games in which each player is a process that is assumed to act independently and strategically. Our main result is that deciding the existence of a strict epsilon Nash equilibrium in such games is 2ExpTime-complete.
  arXiv  Detail & Related papers  (2020-08-13T01:56:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.