5 papers · 1 filter
Distributed Nash Equilibrium Seeking with Logarithmic Bit Rates over Digital Channels
Zihao Ren, Chengyang Jiang, Lei Wang +2
This paper introduces quantization techniques to reduce the communication complexity in the distributed Nash equilibrium (NE) seeking problem, achieving an exponential reduction in…
Minimum Clustering of Matrices Based on Phase Alignment
Honghao Wu, Kemi Ding, Li Qiu
Coordinating multi-agent systems requires balancing synchronization performance and controller implementation costs. To this end, we classify agents by their intrinsic properties,…
Decentralized Optimization with Amplified Privacy via Efficient Communication
Wei Huo, Changxin Liu, Kemi Ding +2
Decentralized optimization is crucial for multi-agent systems, with significant concerns about communication efficiency and privacy. This paper explores the role of efficient commu…
Communication-efficient and Differentially-private Distributed Nash Equilibrium Seeking with Linear Convergence
Xiaomeng Chen, Wei Huo, Kemi Ding +2
The distributed computation of a Nash equilibrium (NE) for non-cooperative games is gaining increased attention recently. Due to the nature of distributed systems, privacy and comm…
Compression-based Privacy Preservation for Distributed Nash Equilibrium Seeking in Aggregative Games
Wei Huo, Xiaomeng Chen, Kemi Ding +2
This paper explores distributed aggregative games in multi-agent systems. Current methods for finding distributed Nash equilibrium require players to send original messages to thei…