University of Cambridge > Talks.cam > CUED Control Group Seminars > Generalized Nash equilibrium seeking under partial information

Generalized Nash equilibrium seeking under partial information

Add to your list(s) Download to your calendar using vCal

  • UserSergio Grammatico, TU Delft
  • ClockThursday 25 March 2021, 14:00-15:00
  • HouseOnline (Zoom).

If you have a question about this talk, please contact Thiago Burghi.

Zoom meeting link: https://zoom.us/j/96326600203

We consider the generalized Nash equilibrium (GNE) problem under partial-decision information, i.e., where each agent can only observe the decisions of its neighbours, while its cost function possibly depends on the actions of some other agents. For this class of equilibrium problems, we propose fully distributed, proximal-point and projected-pseudo-gradient algorithms. Finally, we discuss the numerical performance of our algorithms that can be accelerated via overrelaxation and inertial schemes.

Zoom meeting link: https://zoom.us/j/96326600203

This talk is part of the CUED Control Group Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity