Nash Equilibrium Seeking for Multi-Agent Systems with Information Transmission Constraints

Description

In the non-cooperative game, each player(agent) has a local private cost function, which depends on the actions of all players. The goal of each player is to minimize its cost function by choosing its actions based on the information received from neighboring players. In seeking Nash equilibrium (NE) with multi-agents, each agent's strategy is optimal when considering other agents' decisions. NE is the stable and desirable solution to the non-cooperative game that has wide applications in many areas, such as smart grids, social networks, and sensor networks. Thus, highly efficient NE-seeking algorithms are essential for the analysis and design of non-cooperative games. Communication among players is critical for seeking NE of non-cooperative games. However, in real-world scenarios, communication links may fail or be re-established occasionally, resulting in changes in the network topology. Nevertheless, time-varying networks that satisfy the B-strongly-connected assumptions are suitable models to capture these phenomena. Hence, this motivated us to study NE-seeking algorithms in this proposal for non-cooperative games over time-varying networks under imperfect communication.In recent years, many well-known NE-seeking algorithms have been proposed for noncooperative games, assuming each player can receive precise information from neighboring players. However, the transmitted data in complicated networks can only sometimes be perfect due to various limitations of communication channels for technical or economic reasons in realistic applications.This proposal considers time-varying delays and limited data rates as sources of imperfect communication. Investigating new NE-seeking algorithms under communication constraints and adjusting their convergence performance is highly desirable.If well accomplished, the theoretical results generated in this proposal will lay a solid foundation for NE-seeking methods of non-cooperative games in practical applications.