Differentially Private Distributed Algorithms for Aggregative Games With Guaranteed Convergence

The distributed computation of a Nash equilibrium in aggregative games is gaining increased attention in recent years. Of particular interest is the coordinator-free scenario where individual players only observe the decisions of their neighbors due to practical constraints. Given the noncooperative...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on automatic control Ročník 69; číslo 8; s. 5168 - 5183
Hlavní autori:	Wang, Yongqiang, Nedic, Angelia
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.08.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Accuracy Aggregates Aggregative games Algorithms Computation Convergence Differential privacy Distributed algorithms distributed Nash equilibrium seeking Effectiveness Equilibrium Game theory Games Nash equilibrium Players Privacy
ISSN:	0018-9286, 1558-2523
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!