Abstract
We propose a distributed Nash equilibrium seeking approach that can achieve both almost sure convergence and rigorous differential privacy with finite cumulative privacy budget, which is in sharp contrast to existing differential-privacy solutions for networked games that have to trade provable convergence for differential privacy. The approach is applicable when the communication graph is directed and unbalanced. Numerical comparison results with existing counterparts confirm the effectiveness of the proposed approach.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 5478-5485 |
| Number of pages | 8 |
| Journal | IEEE Transactions on Automatic Control |
| Volume | 69 |
| Issue number | 8 |
| DOIs | |
| State | Published - 2024 |
Keywords
- Differential privacy
- Nash equilibrium seeking
- directed graphs
ASJC Scopus subject areas
- Control and Systems Engineering
- Computer Science Applications
- Electrical and Electronic Engineering