2000 character limit reached
Compression-based Privacy Preservation for Distributed Nash Equilibrium Seeking in Aggregative Games (2405.03106v1)
Published 6 May 2024 in eess.SY, cs.GT, and cs.SY
Abstract: This paper 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.
- Distributed Nash equilibrium seeking: A gossip-based algorithm. Automatica, 72:209–216, 2016.
- Distributed generalized Nash equilibrium seeking for energy sharing games in prosumers. IEEE Transactions on Power Systems, 36(5):3973–3986, 2021.
- Distributed Nash equilibrium seeking by a consensus based approach. IEEE Transactions on Automatic Control, 62(9):4811–4818, 2017.
- A linearly convergent distributed Nash equilibrium seeking algorithm for aggregative games. IEEE Transactions on Automatic Control, 68(3):1753–1759, 2022.
- Networked aggregative games with linear convergence. In 60th IEEE Conference on Decision and Control, pages 3381–3386, 2021.
- Privacy preserving distributed optimization using homomorphic encryption. Automatica, 96:314–325, 2018.
- Differentially private distributed Nash equilibrium seeking for aggregative games. IEEE Transactions on Automatic Control, 67(5):2451–2458, 2021.
- Statistical privacy-preserving online distributed Nash equilibrium tracking in aggregative games. IEEE Transactions on Automatic Control, 2023.
- Differentially private games via payoff perturbation. arXiv preprint arXiv:2303.11157, 2023.
- Differentially private distributed algorithms for stochastic aggregative games. Automatica, 142:110440, 2022.
- Distributed Nash equilibrium seeking with stochastic event-triggered mechanism. Automatica, 162:111486, 2024.
- Distributed Nash equilibrium seeking under quantization communication. Automatica, 141:110318, 2022.
- Distributed Nash equilibrium seeking for aggregative games with quantization constraints. IEEE Transactions on Circuits and Systems I: Regular Papers, 2023.
- Linear convergent distributed Nash equilibrium seeking with compression. arXiv preprint arXiv:2211.07849, 2022.
- Quantization enabled privacy protection in decentralized stochastic optimization. IEEE Transactions on Automatic Control, 2022.
- Compressed differentially private distributed optimization with linear convergence. arXiv preprint arXiv:2304.01779, 2023.
- Communication compression for distributed nonconvex optimization. IEEE Transactions on Automatic Control, 2022.
- A linearly convergent robust compressed push-pull method for decentralized optimization. arXiv preprint arXiv:2303.07091, 2023.
- Appendix of compression-based privacy preservation for distributed Nash equilibrium seeking in aggregative games, https://github.com/vivianwhuo/Appendix-of-Compression-based-Privacy-Preservation-for-Distributed-Nash-Equilibrium-Seeking/blob/main/github-appendix.pdf, 2024.
- Calibrating noise to sensitivity in private data analysis. In Theory of Cryptography: Third Theory of Cryptography Conference, pages 265–284. Springer, 2006.
- Distributed algorithms for aggregative games on graphs. Operations Research, 64(3):680–704, 2016.
- Non-convex generalized Nash games for energy efficient power allocation and beamforming in mmwave networks. IEEE Transactions on Signal Processing, 70:3193–3205, 2022.
- Compression with exact error distribution for federated learning. arXiv preprint arXiv:2310.20682, 2023.
- Distributed average consensus with dithered quantization. IEEE Transactions on Signal Processing, 56(10):4905–4918, 2008.
- Differential privacy in distributed optimization with gradient tracking. IEEE Transactions on Automatic Control, 2024.
- A convergence theorem for nonnegative almost supermartingales and some applications. In Optimizing methods in statistics, pages 233–257. Elsevier, 1971.
- Convergence rate analysis of distributed gossip (linear parameter) estimation: Fundamental limits and tradeoffs. IEEE Journal of Selected Topics in Signal Processing, 5(4):674–690, 2011.
- Distributed linear parameter estimation: Asymptotically efficient adaptive strategies. SIAM Journal on Control and Optimization, 51(3):2200–2229, 2013.