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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automatic control Vol. 69; no. 8; pp. 5168 - 5183
Main Authors:	Wang, Yongqiang, Nedic, Angelia
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.08.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!