Abstract

In this paper, we consider a stochastic noncooperative game where each player can communicate with others via an undirected communication graph. For games with nonlinear payoff function, we design a Nash equilibrium seeking strategy in the presence of noises in information flow. Based on the gradient descent approach and the consensus protocol, the convergence of the seeking strategy is presented. Due to the existence of noises, a neighborhood convergence rather than asymptotic convergence is obtained and the convergence error bound is analyzed. The boundary depends on the step size of gradient and the control gain in the consensus protocol. An example is given to illustrate the results.

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.