Abstract
AbstractIn this article, we study distributed generalized Nash equilibrium (GNE) seeking algorithm in multi-agent network games. We focus on networks described by unbalanced digraphs and concentrate on a class of games with coupling constraints, and give the convergence analysis by using and doubly-augmented operator splitting approach and Perron-Frobenius (PF) eigenvector. We extend the algorithm to the case of intermittent communication and give a theoretical analysis. Finally, we validate the convergence by a Nash-Cournot game example.KeywordsDistributed dynamicsMulti-agent gameGeneralized nash equilibriumUnbalanced digraphsIntermittent communication
Sign-in/Register to access full text options 
Free) 
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
