English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Equilibrium topology of multi-agent systems with two leaders: a zero-sum game perspective

Ma, J., Zheng, Y., Wu, B., & Wang, L. (2016). Equilibrium topology of multi-agent systems with two leaders: a zero-sum game perspective. Automatica, 73, 200-206. doi:10.1016/j.automatica.2016.07.005.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-002D-1BBA-E Version Permalink: http://hdl.handle.net/11858/00-001M-0000-002D-1F6D-9
Genre: Journal Article

Files

show Files

Locators

show
hide
Locator:
Link (Publisher version)
Description:
-

Creators

show
hide
 Creators:
Ma, Jingying, Author
Zheng, Yuanshi, Author
Wu, Bin1, Author              
Wang, Long, Author
Affiliations:
1Department Evolutionary Theory, Max Planck Institute for Evolutionary Biology, Max Planck Society, ou_1445641              

Content

show
hide
Free keywords: Multi-agent systems; Zero-sum game; Containment control; Equilibrium topology
 Abstract: Abstract It is typical in containment control problems to assume that there is no conflict of interest among leaders. In this paper, we consider the situation where there is conflict between leaders; namely, the leaders compete to attract followers. The strategies of each leader are defined by choosing at most k followers to propagate their information. Then, we formulate a standard two-player zero-sum game by using graph theory and matrix theory. We further prove that each player will choose exactly k followers when the game achieves a Nash equilibrium. It is noteworthy that the interaction graph here is generated from the conflict between leaders and then the Nash equilibrium point of the game corresponds to the equilibrium topology. For the case of choosing one follower, a necessary and sufficient condition for an interaction graph to be the equilibrium topology is derived. Moreover, we can obtain the equilibrium topology directly if followers’ interaction graph is a circulant graph or a graph with a center vertex. Simulation examples are provided to validate the effectiveness of the theoretical results.

Details

show
hide
Language(s): eng - English
 Dates: 2015-12-062014-11-052016-06-272016-09-062016
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Method: -
 Identifiers: DOI: 10.1016/j.automatica.2016.07.005
BibTex Citekey: Ma2016200
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Automatica
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Oxford : Pergamon
Pages: - Volume / Issue: 73 Sequence Number: - Start / End Page: 200 - 206 Identifier: ISSN: 0005-1098
CoNE: /journals/resource/954925383082