当前位置: X-MOL 学术Int. J. Coop. Inf. Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Distributed Nash Equilibrium Seeking for Quadratic Games with Security
International Journal of Cooperative Information Systems ( IF 0.5 ) Pub Date : 2019-10-22 , DOI: 10.1142/s0218843019500096
Shouwei Zhang 1 , Shu Liang 2
Affiliation  

Considering a game with quadratic cost functions, this paper presents a distributed algorithm with security, whereby each player updates its strategy variable without using its private data and still achieves the Nash equilibrium. By using the theory of differential inclusions, Lyapunov function and invariance principle, the algorithm is proved to be convergent. Our algorithm can be used when it is required to seek the Nash equilibrium without disclosure of private data.

中文翻译:

求安全二次博弈的分布式纳什均衡

考虑具有二次成本函数的博弈,本文提出了一种具有安全性的分布式算法,每个参与者在不使用其私有数据的情况下更新其策略变量,仍然达到纳什均衡。利用微分包含理论、Lyapunov函数和不变性原理,证明了该算法的收敛性。当需要在不泄露私人数据的情况下寻求纳什均衡时,可以使用我们的算法。
更新日期:2019-10-22
down
wechat
bug