Communication-efficient and Differentially-private Distributed Nash Equilibrium Seeking with Linear Convergence
<|reference_start|>Communication-efficient and Differentially-private Distributed Nash Equilibrium Seeking with Linear Convergence: 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 communication efficiency are two critical concerns. Traditional approaches often address these critical concerns in isolation. This work introduces a unified framework, named CDP-NES, designed to improve communication efficiency in the privacy-preserving NE seeking algorithm for distributed non-cooperative games over directed graphs. Leveraging both general compression operators and the noise adding mechanism, CDP-NES perturbs local states with Laplacian noise and applies difference compression prior to their exchange among neighbors. We prove that CDP-NES not only achieves linear convergence to a neighborhood of the NE in games with restricted monotone mappings but also guarantees $\epsilon$-differential privacy, addressing privacy and communication efficiency simultaneously. Finally, simulations are provided to illustrate the effectiveness of the proposed method.<|reference_end|>
@article{chen2024communication-efficient,
    title={Communication-efficient and Differentially-private Distributed Nash
  Equilibrium Seeking with Linear Convergence},
    author={Xiaomeng Chen, Wei Huo, Kemi Ding, Subhrakanti Dey, Ling Shi},
    journal={arXiv preprint arXiv:2405.04757},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.04757},
    primaryClass={eess.SY cs.GT cs.SY}
}