Abstract
In this paper, a Nash equilibrium seeking problem for an N-players static non-cooperative game with quadratic payoff function is considered, in which each player seeks its maximum quadratic payoff. Unlike most classical game methods for seeking Nash equilibria, in this method, the model of payoff functions and the actions of other players do not need to be known. In the presented algorithm, we adjust the classical extremum seeking control so that the amplitude of sinusoidal excitation signal locally exponentially converges to zero. Consequently, this method can both increase the speed of convergence dramatically and eliminate the adverse effects of steady-state oscillation by reducing the amplitude of sinusoidal excitation signal. The details of stability analysis and proof of this method is provided. Also, at the end a numerical example and simulation which shows the effectiveness and superiority of this approach is presented.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
