English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper we present an averaging technique applicable to the design ofzeroth-order Nash equilibrium seeking algorithms. First, we propose amulti-timescale discrete-time averaging theorem that requires only that theequilibrium is semi-globally practically stabilized by the averaged system,while also allowing the averaged system to depend on ``fast" states.Furthermore, sequential application of the theorem is possible, which enablesits use for multi-layer algorithm design. Second, we apply the aforementionedaveraging theorem to prove semi-global practical convergence of thezeroth-order information variant of the discrete-time projected pseudogradientdescent algorithm, in the context of strongly monotone, constrained Nashequilibrium problems. Third, we use the averaging theory to prove thesemi-global practical convergence of the asynchronous pseudogradient descentalgorithm to solve strongly monotone unconstrained Nash equilibrium problems.Lastly, we apply the proposed asynchronous algorithm to the connectivitycontrol problem in multi-agent systems.

A discrete-time averaging theorem and its application to zeroth-order Nash equilibrium seeking