eduzhai > Applied Sciences > Engineering >

Local Stackelberg equilibrium seeking in generalized aggregative games

  • Save

... pages left unread,continue reading

Document pages: 6 pages

Abstract: We propose a two-layer, semi-decentralized algorithm to compute a localsolution to the Stackelberg equilibrium problem in aggregative games withcoupling constraints. Specifically, we focus on a single-leader,multiple-follower problem, and after equivalently recasting the Stackelberggame as a mathematical program with complementarity constraints (MPCC), weiteratively convexify a regularized version of the MPCC as inner problem, whosesolution generates a sequence of feasible descent directions for the originalMPCC. Thus, by pursuing a descent direction at every outer iteration, weestablish convergence to a local Stackelberg equilibrium. Finally, the proposedalgorithm is tested on a numerical case study involving a hierarchical instanceof the charging coordination of Plug-in Electric Vehicles (PEVs).

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×