Skip to content
Preprint

Best Response Dynamics for Zero-Sum Dynamic Games with Partial-Asymmetric Information

Aug 2026 · 0 citations · 38 references
Mathematics

TL;DR

Numerical results reveal that the game's value converges after only a few iterations, suggesting that higher-order belief states provide vanishing benefit, and an alternative approach based on best response dynamics is proposed, which provides insights into belief representation and theory of mind challenges.

Abstract

This work studies a class of zero-sum stochastic linear quadratic dynamic games (LQDGs) under partial and asymmetric information. Information asymmetry introduces fundamental challenges related to \textit{belief representation} and \textit{theory of mind}, where players must impute belief states and estimates of other players to inform their strategies. Existing work highlights the difficulty of applying dynamic programming-like decomposition approach to these problems. An alternative approach based on \textit{best response dynamics} is proposed, which provides insights into belief representation and theory of mind challenges. Explicit expressions for each player's best response within the class of pure linear dynamic output feedback control strategies are derived, where the internal state dimension of each control is an integer multiple of the system state dimension. As players iteratively update their best responses, they form increasingly higher-order belief states, leading to infinite-dimensional internal states. However, numerical results reveal that the game's value converges after only a few iterations, suggesting that higher-order belief states provide vanishing benefit. This work further conducts numerical experiments to analyze the impact of asymmetric beliefs, belief orders, relative controllability and observability, and direct feed-through on a linear quadratic pursuit-evasion game's value.

View source

Similar papers

#machine learning Preprint Sep 2026

Minimax Last-Iterate Convergence in Matrix Games with Observed Actions

We study last-iterate convergence in unknown two-player zero-sum matrix games with bandit payoff feedback and observed opponent actions. For games with $d$ actions per player, we develop an algorithm achieving a duality gap of $\widetilde{\mathcal{O}}(\sqrt{d/t})$ with high probability, simultaneously at every round $t...

Yu-Heng Zhang · 1 citation
#machine learning Preprint Sep 2026

Algorithmic Collusion and the Complexity of Information-Value-Free Equilibria

The complexity of IVF(C)CEs in succinct games, which model more realistic strategic interactions that feature either many players or exponentially many pure strategies, is examined, showing that it is at least as hard as the P-matrix linear complementarity problem, and hence as hard as simple stochastic games.

I. Anagnostides, Weiqiang Zheng · 1 citation
Preprint Aug 2026

Planning Against Learning in Rank-1 Games

Rank-one games already separate efficient equilibrium computation from strategic planning against a learning opponent, and this result shows that this equilibrium tractability does not extend to planning against learning dynamics.

William Overman · 0 citations
#machine learning Preprint Oct 2026

Pessimistic Minimax Learning for Public-Private Information Games under Unilateral Coverage

We study offline learning in two-player zero-sum contextual games with public and private information, motivated by strategic settings such as auctions and negotiations with private valuations. We introduce unilateral prescriptive concentrability and show that asymmetric information can change offline coverage through...

S. Liu, Claire Chen, Jiuqi Wang et al. · 2 citations
Preprint Sep 2026

Partially Observed Mean Field Games Without Perfect Recall: Optimality Conditions and Equilibria

This paper studies partially observed mean field games without perfect recall (WPR). The representative agent observes a noisy signal, but the control at time \(t\) uses only \(\mathcal G_t^I=\sigma(y_t)\), a generally non-nested information family. The conditional population law instead uses the observation filtration...

Xuan-Ping Zhang, Xiao Zhang, Wang Yao · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.