Abstract
We design a distributed algorithm for generalized Nash equilibrium seeking in aggregative games with linear coupling constraints under partial-decision information, i.e., the agents have no direct access to the aggregate decision. The algorithm is derived by including dynamic tracking together with a standard projected pseudo-gradient algorithm in a fully-distributed fashion. The convergence analysis of the algorithm relies on the framework of monotone operator splitting and Krasnosel'skii-Mann fixed-point iteration with errors.
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.
