Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2511.22919 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912735140249600 |
|---|---|
| author | Guo, Kai-Yuan Wang, Yan-Wu Liu, Xiao-Kang Liu, Zhi-Wei |
| author_facet | Guo, Kai-Yuan Wang, Yan-Wu Liu, Xiao-Kang Liu, Zhi-Wei |
| contents | This paper addresses the distributed Nash Equilibrium seeking problem for aggregative games, where legitimate players' decisions are affected by potential malicious players. To describe players' behavior, we introduce a novel heterogeneous trustworthiness probabilistic framework by employing stochastic trust observations. To mitigate the waste of communication and gradient computation, we utilize a compressible unbalanced network information matrix and a multi-round communication mechanism to develop a fast Nash equilibrium seeking algorithm for aggregative games with unbalanced directed networks. By integrating the multi-round communication mechanism and a trustworthiness broadcast mechanism, we embed our fast convergence algorithm into the heterogeneous trustworthiness probabilistic framework, yielding a resilient fast Nash equilibrium seeking algorithm. Theoretical analysis confirms the convergence of the algorithm. Comparative simulations verify the accuracy of our fast convergence algorithm, and validation simulations verify the resilience of the algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_22919 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fast Distributed Algorithm for Aggregative Games in Malicious Environment Guo, Kai-Yuan Wang, Yan-Wu Liu, Xiao-Kang Liu, Zhi-Wei Systems and Control This paper addresses the distributed Nash Equilibrium seeking problem for aggregative games, where legitimate players' decisions are affected by potential malicious players. To describe players' behavior, we introduce a novel heterogeneous trustworthiness probabilistic framework by employing stochastic trust observations. To mitigate the waste of communication and gradient computation, we utilize a compressible unbalanced network information matrix and a multi-round communication mechanism to develop a fast Nash equilibrium seeking algorithm for aggregative games with unbalanced directed networks. By integrating the multi-round communication mechanism and a trustworthiness broadcast mechanism, we embed our fast convergence algorithm into the heterogeneous trustworthiness probabilistic framework, yielding a resilient fast Nash equilibrium seeking algorithm. Theoretical analysis confirms the convergence of the algorithm. Comparative simulations verify the accuracy of our fast convergence algorithm, and validation simulations verify the resilience of the algorithm. |
| title | Fast Distributed Algorithm for Aggregative Games in Malicious Environment |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2511.22919 |