Abstract

We propose an integral Nash equilibrium seeking control (I-NESC) law which steers the multi-agent system composed of a special class of linear agents to the neighborhood of the Nash equilibrium in noncooperative strongly monotone games. First, we prove that there exist parameters of the integral controller such that the system converges to the Nash equilibrium in the full-information case, in other words, without the parameter estimation scheme used in extremum seeking algorithms. Then we prove that there exist parameters of the I-NESC such that the system converges to the neighborhood of the Nash equilibrium in the limited information case where parameter estimation is used. We provide a simulation example that demonstrates that smaller perturbation frequencies and amplitudes are needed to attain similar convergence speed as the existing state-of-the-art algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.