Differentially Private Distributed Algorithms for Aggregative Games With Guaranteed Convergence
Differentially Private Distributed Algorithms for Aggregative Games With Guaranteed Convergence
The distributed computation of a Nash equilibrium in aggregative games is gaining increased traction in recent years. Of particular interest is the coordinator-free scenario where individual players only access or observe the decisions of their neighbors due to practical constraints. Given the non-cooperative relationship among participating players, protecting the privacy …