arXiv subjects

Hanzheng Zhang

Publications and source records attributed to Hanzheng Zhang.

4 recordsLinked to original sources

arXiv2026

Mobile Target Search with Imperfect Perception: A Partially Observable Stochastic Game Theoretical Approach

This paper investigates mobile target search under imperfect perceptions caused by sensor limitations, malicious jamming, or communication noise. Searchers and targets operate in a grid-shaped area with bounded mobility, leading to a dynamic interplay between search and evasion. To capture this adversarial interaction under imperfect perceptions, we adopt the partially observable stochastic game (POSG) approach, which generalizes partially observable Markov decision processes (POMDPs) by incorporating target intelligence. To handle false alarms and missed detections caused by perceptual uncertainties, we propose a novel detectability concept to determine whether a search strategy guarantees eventual detection, and provide sufficient detectability criteria based on stochastic recurrence analysis. We further develop a server-assisted distributed algorithm that utilizes the aggregative potential game structure for searchers and a KL-divergence-based reduction for target prediction. Numerical simulations validate the effectiveness of the proposed algorithm and support the detectability analysis.

cs.RO↗

arXiv2024

Bayesian hypergame approach to equilibrium stability and robustness in moving target defense

We investigate the equilibrium stability and robustness in a class of moving target defense problems, in which players have both incomplete information and asymmetric cognition. We first establish a Bayesian Stackelberg game model for incomplete information and then employ a hypergame reformulation to address asymmetric cognition. With the core concept of the hyper Bayesian Nash equilibrium (HBNE), a condition for achieving both the strategic and cognitive stability in equilibria can be realized by solving linear equations. Moreover, to deal with players' underlying perturbed knowledge, we study the equilibrium robustness by presenting a condition of robust HBNE under the given configuration. Experiments evaluate our theoretical results.

cs.GT↗

arXiv2023

Bayesian Nash Equilibrium Seeking for Distributed Incomplete-information Aggregative Games

In this paper, we consider a distributed Bayesian Nash equilibrium (BNE) seeking problem in incomplete-information aggregative games, which is a generalization of Bayesian games and deterministic aggregative games. We handle the aggregation function for distributed incomplete-information situations. Since the feasible strategies are infinite-dimensional functions and lie in a non-compact set, the continuity of types brings barriers to seeking equilibria. To this end, we discretize the continuous types and then prove that the equilibrium of the derived discretized model is an $ε$-BNE. On this basis, we propose a distributed algorithm for an $ε$-BNE and further prove its convergence.

math.OC↗

arXiv2022

Distributed Algorithm for Continuous-type Bayesian Nash Equilibrium in Subnetwork Zero-sum Games

In this paper, we consider a continuous-type Bayesian Nash equilibrium (BNE) seeking problem in subnetwork zero-sum games, which is a generalization of deterministic subnetwork zero-sum games and discrete-type Bayesian zero-sum games. In this continuous-type model, because the feasible strategy set is composed of infinite-dimensional functions and is not compact, it is hard to seek a BNE in a non-compact set and convey such complex strategies in network communication. To this end, we design two steps to overcome the above bottleneck. One is a discretization step, where we discretize continuous types and prove that the BNE of the discretized model is an approximate BNE of the continuous model with an explicit error bound. The other one is a communication step, where we adopt a novel compression scheme with a designed sparsification rule and prove that agents can obtain unbiased estimations through compressed communication. Based on the above two steps, we propose a distributed communication-efficient algorithm to practicably seek an approximate BNE, and further provide an explicit error bound and an $O(\ln T/\sqrt{T})$ convergence rate.

math.OC↗