Control Meets Inference: Using Network Control to Uncover the Behaviour of Opponents |
| |
Authors: | Zhongqi Cai Enrico Gerding Markus Brede |
| |
Institution: | School of Electronics and Computer Science, University of Southampton, Southampton SO17 1BJ, UK; (E.G.); (M.B.) |
| |
Abstract: | Using observational data to infer the coupling structure or parameters in dynamical systems is important in many real-world applications. In this paper, we propose a framework of strategically influencing a dynamical process that generates observations with the aim of making hidden parameters more easily inferable. More specifically, we consider a model of networked agents who exchange opinions subject to voting dynamics. Agent dynamics are subject to peer influence and to the influence of two controllers. One of these controllers is treated as passive and we presume its influence is unknown. We then consider a scenario in which the other active controller attempts to infer the passive controller’s influence from observations. Moreover, we explore how the active controller can strategically deploy its own influence to manipulate the dynamics with the aim of accelerating the convergence of its estimates of the opponent. Along with benchmark cases we propose two heuristic algorithms for designing optimal influence allocations. We establish that the proposed algorithms accelerate the inference process by strategically interacting with the network dynamics. Investigating configurations in which optimal control is deployed. We first find that agents with higher degrees and larger opponent allocations are harder to predict. Second, even factoring in strategical allocations, opponent’s influence is typically the harder to predict the more degree-heterogeneous the social network. |
| |
Keywords: | network inference voting dynamics complex networks network control |
|
|