Skip to main navigation Skip to search Skip to main content

Graphical Games: Distributed Multiplayer Games on Graphs

  • Frank L. Lewis*
  • , Hongwei Zhang
  • , Kristian Hengster-Movric
  • , Abhijit Das
  • *Corresponding author for this work
  • University of Texas at Arlington
  • Southwest Jiaotong University
  • Danfoss AS

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this chapter, it is seen that distributed control protocols that both guarantee synchronization and are globally optimal for the multi-agent team always exist on any sufficiently connected communication graph if a different definition of optimality is used. To this end, we study the notion of Nash equilibrium for multiplayer games on graphs. This leads us to the idea of a new sort of differential game—graphical games. In graphical games, each agent has its own dynamics as well as its own local performance index. The dynamics and local performance indices of each agent are distributed; they depend on the state of the agent, the control of the agent, and the controls of the agent’s neighbors. We show how to compute distributed control protocols that guarantee global Nash equilibrium for multi-agent teams on any graph that has a spanning tree.

Original languageEnglish
Title of host publicationCommunications and Control Engineering
PublisherSpringer International Publishing
Pages181-217
Number of pages37
Edition9781447155737
DOIs
StatePublished - 2014
Externally publishedYes

Publication series

NameCommunications and Control Engineering
Number9781447155737
ISSN (Print)0178-5354
ISSN (Electronic)2197-7119

Keywords

  • Nash

Fingerprint

Dive into the research topics of 'Graphical Games: Distributed Multiplayer Games on Graphs'. Together they form a unique fingerprint.

Cite this