國立虎尾科技大學 |

登入

回首頁

Nash Equilibrium Seeking Over Undire...

ProQuest Information and Learning Co.

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

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Nash Equilibrium Seeking Over Undirected Graphs Via Multi-Agent Agreement./
作者:	Gadjov, Dian.
面頁冊數:	1 online resource (136 pages)
附註:	Source: Masters Abstracts International, Volume: 57-01.
Contained By:	Masters Abstracts International57-01(E).
標題:	Systems science. -
電子資源:	click for full text (PQDT)
ISBN:	9780355448955

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

Nash Equilibrium Seeking Over Undirected Graphs Via Multi-Agent Agreement. - 1 online resource (136 pages)

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

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

Includes bibliographical references

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.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780355448955Subjects--Topical Terms:

1148479
Systems science.
Index Terms--Genre/Form:

554714
Electronic books.

Nash Equilibrium Seeking Over Undirected Graphs Via Multi-Agent Agreement.
LDR:02256ntm a2200349Ki 4500 001 918825
005 20181106104112.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9780355448955
035 $a (MiAaPQ)AAI10623975
035 $a (MiAaPQ)toronto:16158
035 $a AAI10623975
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Gadjov, Dian. $3 1193256
245 1 0 $a Nash Equilibrium Seeking Over Undirected Graphs Via Multi-Agent Agreement.
264 0 $c 2017
300 $a 1 online resource (136 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
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.
504 $a Includes bibliographical references
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.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Systems science. $3 1148479
650 4 $a Electrical engineering. $3 596380
650 4 $a Applied mathematics. $3 1069907
655 7 $a Electronic books. $2 local $3 554714
690 $a 0790
690 $a 0544
690 $a 0364
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Toronto (Canada). $b Electrical and Computer Engineering. $3 1148628
773 0 $t Masters Abstracts International $g 57-01(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10623975 $z click for full text (PQDT)

筆 0 讀者評論

多媒體

評論

新增評論分享你的心得

Export

取書館別