東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Nash Equilibrium Seeking Over Undire...

Gadjov, Dian.

Linked to FindBook

Google Book

Amazon

博客來

Nash Equilibrium Seeking Over Undirected Graphs Via Multi-Agent Agreement.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Nash Equilibrium Seeking Over Undirected Graphs Via Multi-Agent Agreement./
Author:	Gadjov, Dian.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2017,
Description:	136 p.
Notes:	Source: Masters Abstracts International, Volume: 57-01.
Contained By:	Masters Abstracts International57-01(E).
Subject:	Systems science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10623975
ISBN:	9780355448955

Nash Equilibrium Seeking Over Undirected Graphs Via Multi-Agent Agreement.
Gadjov, Dian.

Nash Equilibrium Seeking Over Undirected Graphs Via Multi-Agent Agreement. - Ann Arbor : ProQuest Dissertations & Theses, 2017 - 136 p.

Source: Masters Abstracts International, Volume: 57-01.

Thesis (M.A.S.)--University of Toronto (Canada), 2017.

We consider the problem of distributed Nash equilibrium seeking over networks. In this setting, agents have limited information about the other players' actions and are forced to communicate with neighbouring agents. We start with a continuous-time gradient-play dynamics, with perfect information, under a strictly monotone pseudo-gradient assumption. In the partial information case we modify the gradient-play dynamics between players by expanding the action space. We propose an augmented gradient-play dynamics in which players can only communicate locally with their neighbours to compute an estimate of the other players' actions. We derive new dynamics based on the reformulation of the problem as a multi-agent coordination problem, over an undirected graph. We exploit the incremental passivity properties in the dynamics and show that a Laplacian feedback can be designed using relative estimates of their neighbours. We highlight that there is a trade-off between properties of the game and the communication graph.

ISBN: 9780355448955Subjects--Topical Terms:

3168411
Systems science.

Nash Equilibrium Seeking Over Undirected Graphs Via Multi-Agent Agreement.
LDR:01974nmm a2200313 4500 001 2164308
005 20181106104112.5
008 190424s2017 ||||||||||||||||| ||eng d
020 $a 9780355448955
035 $a (MiAaPQ)AAI10623975
035 $a (MiAaPQ)toronto:16158
035 $a AAI10623975
040 $a MiAaPQ $c MiAaPQ
100 1 $a Gadjov, Dian. $3 3352355
245 1 0 $a Nash Equilibrium Seeking Over Undirected Graphs Via Multi-Agent Agreement.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2017
300 $a 136 p.
500 $a Source: Masters Abstracts International, Volume: 57-01.
500 $a Adviser: Lacra Pavel.
502 $a Thesis (M.A.S.)--University of Toronto (Canada), 2017.
520 $a We consider the problem of distributed Nash equilibrium seeking over networks. In this setting, agents have limited information about the other players' actions and are forced to communicate with neighbouring agents. We start with a continuous-time gradient-play dynamics, with perfect information, under a strictly monotone pseudo-gradient assumption. In the partial information case we modify the gradient-play dynamics between players by expanding the action space. We propose an augmented gradient-play dynamics in which players can only communicate locally with their neighbours to compute an estimate of the other players' actions. We derive new dynamics based on the reformulation of the problem as a multi-agent coordination problem, over an undirected graph. We exploit the incremental passivity properties in the dynamics and show that a Laplacian feedback can be designed using relative estimates of their neighbours. We highlight that there is a trade-off between properties of the game and the communication graph.
590 $a School code: 0779.
650 4 $a Systems science. $3 3168411
650 4 $a Electrical engineering. $3 649834
650 4 $a Applied mathematics. $3 2122814
690 $a 0790
690 $a 0544
690 $a 0364
710 2 $a University of Toronto (Canada). $b Electrical and Computer Engineering. $3 2096349
773 0 $t Masters Abstracts International $g 57-01(E).
790 $a 0779
791 $a M.A.S.
792 $a 2017
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10623975