The topology in the game controllability of multiagent systems

TL;DR

This paper introduces a graph-theoretic condition for the controllability of game-based control systems with non-zero regulator control inputs, linking topology directly to controllability without complex algebraic calculations.

Contribution

It proposes a novel graph theory condition for GBCS controllability using the concept of strategy matrices, extending previous zero-regulator assumptions.

Findings

Derived a general formula for game controllability matrix based on topology.

Established a direct method to judge controllability from graph structure.

Conjectured no limitation of equivalent partition in GBCS, extending existing graph theory results.

Abstract

In this paper, the graph based condition for the controllability of game based control system is presented when the control of regulator is not zero. A control framework which can describe realism well expressed as the game based control system (GBCS), was obtained in 2019, which, unfortunately, is not graph theoretically verifiable, and the regulator control input is assumed to be zero. However, based on a new established notion, strategy matrix, we propose a graph theory condition to judge the controllability of GBCS, instead of using algebraic conditions for complex mathematical calculations. More specifically, to tackle these issues, one needs to study the expression of Nash equilibrium actions when regulators control is not zero first. Based on this expression, the general formula of game controllability matrix is obtained, which provides theoretical support for studying the essential influence of topology on game based control system. The general formula is always affected by the specific matrix strategy matrix, composed of Nash equilibrium actions, and the matrix can not only be obtained by matrix calculation, but also can be directly written through the topology, which is the specific influence of the topology on the GBCS. Finally, we obtain the result of judging the controllability of the system directly according to the topological structure, and put forward the conjecture that there is no limitation of equivalent partition in GBCS. Arguably, this is a surprising conjecture on the equivalent partition of graphs, because only the limitation of equivalent partition in fivenode graphs has been solved so far