We consider a target selection problem for multitarget tracking in a multifunction radar network from a gametheoretic perspective. The problem is formulated as a noncooperative game. The radars are considered to be players in this game with utilities modeled using a proper tracking accuracy criterion and their strategies are the observed targets whose number is known. Initially, for the problem of coordination, the Nash equilibria are characterized and, in order to find equilibria points, a distributed algorithm based on the bestresponse dynamics is proposed. Afterwards, the analysis is extended to the case of partial target observability and radar connectivity and heterogeneous interests among radars. The solution concept of correlated equilibria is employed and a distributed algorithm based on the regret-matching is proposed. The proposed algorithms are shown to perform well compared to the centralized approach of significantly higher complexity@en

In this paper, a track selection problem for multi-target tracking in a multifunction radar network is studied using the concepts from game theory. The problem is formulated as a non-cooperative game, and specifically as an anti-coordination game, where each player aims to differ from what other players do. The players' utilities are modeled using a proper tracking accuracy criterion and, under different assumptions on the structure of these utilities, the corresponding Nash equilibria are characterized. To find an equilibrium, a distributed algorithm based on the best-response dynamics is proposed. Finally, computer simulations are carried out to verify the effectiveness of the proposed algorithm in a multi-target tracking scenario.@en

In this paper, the parameter estimation problem based on diffusion least mean squares strategies is analyzed from a coalitional game theoretical perspective. Specifically, while selfishly minimizing only their own mean-square costs, the nodes in a network form coalitions that benefit them. Due to its nature, the problem is modeled as a non-transferable game and two scenarios are studied, one where each node’s payoff includes only a suitable estimation accuracy criterion and another one in which a graph-based communication cost is also considered. In the former scenario, we first analyze the non-emptiness of the core of the games corresponding to traditional diffusion strategies, and then, the analysis is extended to a recently proposed node-specific parameter estimation setting where the nodes have overlapped but different estimation interests. In the latter scenario, after formulating a coalitional graph game and providing sufficient conditions for its core non-emptiness, we propose a distributed graph formation algorithm, based on merge-and-split approach, which converges to a stable coalition structure.@en

The problem of range-migrating target detection in a compound-Gaussian clutter is studied here. We assume a target to have a range-walk of a few range cells during the coherent processing interval, when observed by wideband radar with high range resolution. Two CFAR detectors are proposed assuming different correlation properties of clutter over range. The detectors' performance is studied via numerical simulations and a significant improvement over existing techniques is demonstrated.@en