In this paper, Nash equilibrium seeking among a network of players is considered. Different from many existing works on Nash equilibrium seeking in non-cooperative games, the players considered in this paper cannot directly observe the actions of the players who are not their neighbors. Instead, the players are supposed to be capable of communicating with each other via an undirected and connected communication graph. By a synthesis of a leader-following consensus protocol and the gradient play, a distributed Nash equilibrium seeking strategy is proposed for the non-cooperative games. Analytical analysis on the convergence of the players' actions to the Nash equilibrium is conducted via Lyapunov stability analysis. For games with non-quadratic payoffs, where multiple isolated Nash equilibria may coexist in the game, a local convergence result is derived under certain conditions. Then, a stronger condition is provided to derive a non-local convergence result for the non-quadratic games. For quadratic games, it is shown that the proposed seeking strategy enables the players' actions to converge to the Nash equilibrium globally under the given conditions. Numerical examples are provided to verify the effectiveness of the proposed seeking strategy.
In this paper, an aggregate game is adopted for the modeling and analysis of energy consumption control in smart grid. Since the electricity users' cost functions depend on the aggregate energy consumption, which is unknown to the end users, an average consensus protocol is employed to estimate it. By neighboring communication among the users about their estimations on the aggregate energy consumption, Nash seeking strategies are developed. Convergence properties are explored for the proposed Nash seeking strategies. For energy consumption game that may have multiple isolated Nash equilibria, a local convergence result is derived. The convergence is established by utilizing singular perturbation analysis and Lyapunov stability analysis. Energy consumption control for a network of heating, ventilation, and air conditioning systems is investigated. Based on the uniqueness of the Nash equilibrium, it is shown that the players' actions converge to a neighborhood of the unique Nash equilibrium nonlocally. More specially, if the unique Nash equilibrium is an inner Nash equilibrium, an exponential convergence result is obtained. Energy consumption game with stubborn players is studied. In this case, the actions of the rational players can be driven to a neighborhood of their best response strategies by using the proposed method. Numerical examples are presented to verify the effectiveness of the proposed methods.
This paper aims to reduce the communication and computation costs of the Nash equilibrium seeking strategy for the N -coalition noncooperative games proposed in [1]. The objective is achieved in two manners: 1. An interference graph is introduced to describe the interactions among the agents in each coalition. 2. The Nash equilibrium seeking strategy is designed with the interference graphs considered. The convergence property of the proposed Nash equilibrium seeking strategy is analytically investigated. It is shown that the agents' actions generated by the proposed method converge to a neighborhood of the Nash equilibrium of the graphical Ncoalition noncooperative games under certain conditions. Several special cases where there is only one coalition and/or there are coalitions with only one agent are considered. The results for the special cases demonstrate that the proposed seeking strategy achieves the solution seeking for noncooperative games, social cost minimization problems and single-agent optimization problems in a unified framework. Numerical examples are presented to support the theoretical results.
Summary
This paper considers a consensus problem for hybrid multiagent systems, which comprise two groups of agents: a group of continuous‐time dynamic agents and a group of discrete‐time dynamic agents. Firstly, a game‐theoretic approach is adopted to model the interactions between the two groups of agents. To achieve consensus for the considered hybrid multiagent systems, the cost functions are designed. Moreover, it is shown that the designed game admits a unique Nash equilibrium. Secondly, sufficient/necessary conditions of solving consensus are established. Thirdly, we find that the convergence speed of the system depends on the game. By the mechanism design of the game, the convergence speed is increased. Finally, simulation examples are given to validate the effectiveness of the theoretical results.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.