Online Competitive Information Gathering for Partially Observable Trajectory Games

• URL: http://arxiv.org/abs/2506.01927v1
• Date: Mon, 02 Jun 2025 17:45:58 GMT
• Title: Online Competitive Information Gathering for Partially Observable Trajectory Games
• Authors: Mel Krusniak, Hang Xu, Parker Palermo, Forrest Laine,
• Abstract summary: Game-theoretic agents must make plans that optimally gather information about their opponents.<n>We formulate a finite history/horizon refinement of POSGs which admits competitive information gathering behavior in trajectory space.<n>We present an online method for computing rational trajectory plans in these games which leverages particle-based estimations of the state space and performs gradient play.
• Score: 24.25139588281181
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Game-theoretic agents must make plans that optimally gather information about their opponents. These problems are modeled by partially observable stochastic games (POSGs), but planning in fully continuous POSGs is intractable without heavy offline computation or assumptions on the order of belief maintained by each player. We formulate a finite history/horizon refinement of POSGs which admits competitive information gathering behavior in trajectory space, and through a series of approximations, we present an online method for computing rational trajectory plans in these games which leverages particle-based estimations of the joint state space and performs stochastic gradient play. We also provide the necessary adjustments required to deploy this method on individual agents. The method is tested in continuous pursuit-evasion and warehouse-pickup scenarios (alongside extensions to $N > 2$ players and to more complex environments with visual and physical obstacles), demonstrating evidence of active information gathering and outperforming passive competitors.

Related papers

• A Data-Driven Discretized CS:GO Simulation Environment to Facilitate Strategic Multi-Agent Planning Research [1.1765015608581086]
  We present DECOY, a novel multi-agent simulator that abstracts strategic, long-horizon planning in 3D terrains into high-level discretized simulation.<n>Using Counter-Strike: Global Offensive as a testbed, our framework accurately simulates gameplay using only movement decisions as tactical positioning.
  arXiv  Detail & Related papers  (2025-09-08T06:02:59Z)
• Through the Gaps: Uncovering Tactical Line-Breaking Passes with Clustering [0.0]
  Line-breaking passes (LBPs) are crucial tactical actions in football, allowing teams to penetrate defensive lines and access high-value spaces.<n>We present an unsupervised, clustering-based framework for detecting and analysing LBPs using synchronised event and tracking data from elite matches.<n>Our approach models opponent team shape through vertical spatial segmentation and identifies passes that disrupt defensive lines within open play.<n>We evaluate these metrics across teams and players in the 2022 FIFA World Cup, revealing stylistic differences in vertical progression and structural disruption.
  arXiv  Detail & Related papers  (2025-06-07T05:08:24Z)
• Model as a Game: On Numerical and Spatial Consistency for Generative Games [117.36098212829766]
  We revisit the paradigm of generative games to explore what truly constitutes a Model as a Game (MaaG) with a well-developed mechanism.<n>Based on the DiT architecture, we design two specialized modules: (1) a numerical module that integrates a LogicNet to determine event triggers, with calculations processed externally as conditions for image generation; and (2) a spatial module that maintains a map of explored areas, retrieving location-specific information during generation and linking new observations to ensure continuity.
  arXiv  Detail & Related papers  (2025-03-27T05:46:15Z)
• TranSPORTmer: A Holistic Approach to Trajectory Understanding in Multi-Agent Sports [28.32714256545306]
  TranSPORTmer is a unified transformer-based framework capable of addressing all these tasks. It effectively captures temporal dynamics and social interactions in an equivariant manner. It outperforms state-of-the-art task-specific models in player forecasting, player forecasting-imputation, ball inference, and ball imputation.
  arXiv  Detail & Related papers  (2024-10-23T11:35:44Z)
• Sports-Traj: A Unified Trajectory Generation Model for Multi-Agent Movement in Sports [53.637837706712794]
  We propose a Unified Trajectory Generation model, UniTraj, that processes arbitrary trajectories as masked inputs.<n>Specifically, we introduce a Ghost Spatial Masking (GSM) module, embedded within a Transformer encoder, for spatial feature extraction.<n>We benchmark three practical sports datasets, Basketball-U, Football-U, and Soccer-U, for evaluation.
  arXiv  Detail & Related papers  (2024-05-27T22:15:23Z)
• Exploiting hidden structures in non-convex games for convergence to Nash equilibrium [62.88214569402201]
  A wide array of modern machine learning applications can be formulated as non-cooperative Nashlibria. We provide explicit convergence guarantees for both deterministic and deterministic environments.
  arXiv  Detail & Related papers  (2023-12-27T15:21:25Z)
• Game-Theoretic Robust Reinforcement Learning Handles Temporally-Coupled Perturbations [98.5802673062712]
  We introduce temporally-coupled perturbations, presenting a novel challenge for existing robust reinforcement learning methods. We propose GRAD, a novel game-theoretic approach that treats the temporally-coupled robust RL problem as a partially observable two-player zero-sum game.
  arXiv  Detail & Related papers  (2023-07-22T12:10:04Z)
• Data-Scarce Identification of Game Dynamics via Sum-of-Squares Optimization [29.568222003322344]
  We introduce the Side-Information Assisted Regression (SIAR) framework, designed to identify game dynamics in multiplayer normal-form games. SIAR is solved using sum-of-squares (SOS) optimization, resulting in a hierarchy of approximations that provably converge to the true dynamics of the system. We showcase that the SIAR framework accurately predicts player behavior across a spectrum of normal-form games, widely-known families of game dynamics, and strong benchmarks, even if the unknown system is chaotic.
  arXiv  Detail & Related papers  (2023-07-13T09:14:48Z)
• 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)
• Improving Bidding and Playing Strategies in the Trick-Taking game Wizard using Deep Q-Networks [0.0]
  The trick-taking game Wizard with a separate bidding and playing phase is modeled by two interleaved partially observable Markov decision processes (POMDP) Deep Q-Networks (DQN) are used to empower self-improving agents, which are capable of tackling the challenges of a highly non-stationary environment. The trained DQN agents achieve accuracies between 66% and 87% in self-play, leaving behind both a random baseline and a rule-based asymmetry.
  arXiv  Detail & Related papers  (2022-05-27T08:59:42Z)
• ShuttleNet: Position-aware Fusion of Rally Progress and Player Styles for Stroke Forecasting in Badminton [18.524164548051417]
  This paper focuses on objectively judging what and where to return strokes in turn-based sports. We propose a novel Position-aware Fusion of Rally Progress and Player Styles framework (ShuttleNet) that incorporates rally progress and information of the players.
  arXiv  Detail & Related papers  (2021-12-02T08:14:23Z)
• Deep Latent Competition: Learning to Race Using Visual Control Policies in Latent Space [63.57289340402389]
  Deep Latent Competition (DLC) is a reinforcement learning algorithm that learns competitive visual control policies through self-play in imagination. Imagined self-play reduces costly sample generation in the real world, while the latent representation enables planning to scale gracefully with observation dimensionality.
  arXiv  Detail & Related papers  (2021-02-19T09:00:29Z)
• A Spatial-Temporal Attentive Network with Spatial Continuity for Trajectory Prediction [74.00750936752418]
  We propose a novel model named spatial-temporal attentive network with spatial continuity (STAN-SC) First, spatial-temporal attention mechanism is presented to explore the most useful and important information. Second, we conduct a joint feature sequence based on the sequence and instant state information to make the generative trajectories keep spatial continuity.
  arXiv  Detail & Related papers  (2020-03-13T04:35:50Z)

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.