arrow
Return

Differentially Private Distributed Algorithms for Aggregative Games With Guaranteed Convergence

delete2024-08-01
delete2
delete
OA
AI
Y
Yongqiang Wang *
A
Angelia Nedić
DOI:10.1109/TAC.2024.3351068delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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 relationship among participating players, protecting the privacy of individual players becomes imperative when sensitive information is involved. We propose a fully distributed equilibrium-seeking approach for aggregative games that can achieve both rigorous differential privacy and guaranteed computation accuracy of the Nash equilibrium. This is in sharp contrast to existing differential-privacy solutions for aggregative games that have to either sacrifice the accuracy of equilibrium computation to gain rigorous privacy guarantees or allow the cumulative privacy budget to grow unbounded, hence, losing privacy guarantees as iteration proceeds. Our approach uses independent noises across players, thus making it effective even when adversaries have access to all shared messages as well as the underlying algorithm structure. The encryption-free nature of the proposed approach also ensures efficiency in computation and communication. The approach is also applicable in stochastic aggregative games, able to ensure both rigorous differential privacy and guaranteed computation accuracy of the Nash equilibrium when individual players only have stochastic estimates of their pseudogradient mappings. Numerical comparisons with existing counterparts confirm the effectiveness of the proposed approach.
Keywords:
Games
Privacy
Convergence
Nash equilibrium
Differential privacy
Aggregates
Distributed algorithms
Aggregative games
distributed Nash equilibrium seeking
differential privacy

Journal

IEEE Transactions on Automatic Control cover
IEEE Transactions on Automatic Control
IF:
7
Papers:
1.3W
Citations:
6.7W

Organization

A
Arizona State University
Scholars:
2.7W
Papers: 2.5W
Citations: 4.2W
C
Clemson University
Scholars:
1.3W
Papers: 1.1W
Citations: 1.4W