Scaling Algorithms for the Shortest Paths Problem
SIAM Journal on Computing
Applied Optimal Control and Estimation
Applied Optimal Control and Estimation
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
Correlated equilibria in graphical games
Proceedings of the 4th ACM conference on Electronic commerce
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Brief paper: Adaptive optimal control for continuous-time linear systems based on policy iteration
Automatica (Journal of IFAC)
Cooperative Control of Dynamical Systems: Applications to Autonomous Vehicles
Cooperative Control of Dynamical Systems: Applications to Autonomous Vehicles
Online actor-critic algorithm to solve the continuous-time infinite horizon optimal control problem
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
Graphical models for game theory
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
A Comprehensive Survey of Multiagent Reinforcement Learning
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Decentralized Learning in Markov Games
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Tracking control for multi-agent consensus with an active leader and variable topology
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
Value-function reinforcement learning in Markov games
Cognitive Systems Research
Internal structure of coalitions in competitive and altruistic graphical coalitional games
Automatica (Journal of IFAC)
Hi-index | 22.15 |
Multi-agent systems arise in several domains of engineering and can be used to solve problems which are difficult for an individual agent to solve. Strategies for team decision problems, including optimal control, N-player games (H-infinity control and non-zero sum), and so on are normally solved for off-line by solving associated matrix equations such as the coupled Riccati equations or coupled Hamilton-Jacobi equations. However, using that approach players cannot change their objectives online in real time without calling for a completely new off-line solution for the new strategies. Therefore, in this paper we bring together cooperative control, reinforcement learning, and game theory to present a multi-agent formulation for the online solution of team games. The notion of graphical games is developed for dynamical systems, where the dynamics and performance indices for each node depend only on local neighbor information. It is shown that standard definitions for Nash equilibrium are not sufficient for graphical games and a new definition of ''Interactive Nash Equilibrium'' is given. We give a cooperative policy iteration algorithm for graphical games that converges to the best response when the neighbors of each agent do not update their policies, and to the cooperative Nash equilibrium when all agents update their policies simultaneously. This is used to develop methods for online adaptive learning solutions of graphical games in real time along with proofs of stability and convergence.