Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.03122

Turn-Based Combat Arena: A New Framework for Multiagent Training and Game Balancing

V. M. Vasyuta·V. V. Malitskyi·O. S. Kushnir·B. I. Horon·V. A. Franiv
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper is the first in a series on Turn-Based Combat Arena, a configurable framework for turn-based strategy games designed to support the efficient training and evaluation of machine learning agents. The proposed framework enables flexible modification of game rules and parameters, allowing rapid experimentation across diverse scenarios. Its architecture is optimized for high-throughput simulation, supporting tens of thousands of games per second and enabling the storage and processing of billions of gameplay records on a single machine. The problem of balancing the game, and particularly the parameters of game units, is investigated in detail. We evaluate several optimization approaches and show that multiple methods converge to comparable solutions, suggesting robustness in identifying balanced game configurations. These results indicate that the framework can serve as a practical platform for both game design analysis and agent training.

Explore related subjects

cs.GT

Keep this discovery

BibTeXRIS

V. M. Vasyuta, V. V. Malitskyi, O. S. Kushnir, B. I. Horon, V. A. Franiv. 2026-09-02. Turn-Based Combat Arena: A New Framework for Multiagent Training and Game Balancing. https://arxiv.org/abs/2609.03122

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.GT subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Self-Geometry: GT-Free and Plug-and-Play Test-Time Adaptation for Geometrically Consistent 3D Vision Foundation Models

Recent Vision Foundation Models (VFMs) predict depth, camera pose, and pointmap in a single forward pass without per-scene optimization, achieving strong generalization. However, enforcing explicit multi-view geometric consistency, e.g., through bundle adjustment, is computationally costly and is thus not imposed during VFM pretraining, so such inconsistency can arise. To address this, implicit self-consistency derived from model outputs (e.g., pointmaps, features), though enforced at test-time in prior work, delivers inherently limited performance gain, especially on scenes where the pretrained VFM is highly inaccurate. In contrast to this implicit signal, we propose Self-Geometry, a plug-and-play test-time adaptation pipeline that directly imposes explicit multi-view geometric constraints using 2D pixel correspondences as pseudo ground-truth. Our proposed Self-Geometry consists of Geometric Disentanglement Optimization, which combines Multi-View Consistency and Epipolar Consistency losses with Gradient Disentanglement to prevent gradient conflict; Frame Angular-Neighbor, a view sampler based on SO(3) geodesic distances for lightly imposing these constraints; and Lightweight TTA, which adapts VFMs via LoRA. Our method achieves consistent improvements in both pose and geometry estimation across six VFMs (VGGT, $π^3$, DA3-Giant/Large/Base/Small) and four benchmarks (7Scenes, ETH3D, ScanNet++, HiRoom).

cs.CV↗
arXiv2026

Peer Oversight in Collective Decision Making

This article introduces peer $k$-oversight, a property of sequential collective decision mechanisms requiring at least $k$ agents to be responsible for every harmful outcome. It is shown that whenever $k$-oversight can be achieved by redistributing control over the decisions in a mechanism, it can be achieved using just $k$ agents. A polynomial-time algorithm is also presented that determines whether such a redistribution exists and, when it does, constructs one. These results establish peer oversight as a tractable design principle for multiagent decision-making systems.

cs.GT↗