In this paper, we investigate distributed Nash equilibrium seeking for a
class of two-subnetwork zero-sum games characterized by bilinear coupling. We
present a distributed primal-dual accelerated mirror-descent algorithm that
guarantees convergence. However, we demonstrate that this time-varying
algorithm is not robust, as it fails to converge under even the slightest
disturbances. To address this limitation, we introduce a distributed
accelerated algorithm that employs a coordinated restarting mechanism. We model
this new algorithm as a hybrid dynamical system and establish that it possesses
structural robustness.

Este artículo explora los viajes en el tiempo y sus implicaciones.

Descargar PDF: