Compression-Based Privacy Preservation for Distributed Nash Equilibrium Seeking in Aggregative Games
IEEE CONTROL SYSTEMS LETTERS(2024)
Abstract
This letter explores distributed aggregative games in multi-agent systems. Current methods for finding distributed Nash equilibrium require players to send original messages to their neighbors, leading to communication burden and privacy issues. To jointly address these issues, we propose an algorithm that uses stochastic compression to save communication resources and conceal information through random errors induced by compression. Our theoretical analysis shows that the algorithm guarantees convergence accuracy, even with aggressive compression errors used to protect privacy. We prove that the algorithm achieves differential privacy through a stochastic quantization scheme. Simulation results for energy consumption games support the effectiveness of our approach.
MoreTranslated text
Key words
Privacy,Games,Convergence,Vectors,Nash equilibrium,Stochastic processes,Differential privacy,Distributed network,information compression,differential privacy
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined