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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on automatic control Jg. 69; H. 8; S. 5168 - 5183
Hauptverfasser:	Wang, Yongqiang, Nedic, Angelia
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.08.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!