A Shared-Constraint Approach to Multi-leader Multi-follower Games
Ankur A. Kulkarni, Uday V. Shanbhag

TL;DR
This paper introduces a shared-constraint reformulation for multi-leader multi-follower games, providing new existence results and linking equilibria of the modified game to the original, with applications demonstrated through examples.
Contribution
It proposes a shared-constraint approach that ensures the existence of equilibria in complex hierarchical games and relates these to the original game structure.
Findings
Global minimizers of the potential function are equilibria of the modified game.
Existence of equilibria is established using fixed point theory without potentiality.
Modified game equilibria can be related back to the original game.
Abstract
Multi-leader multi-follower games are a class of hierarchical games in which a collection of leaders compete in a Nash game constrained by the equilibrium conditions of another Nash game amongst the followers. The resulting equilibrium problem with equilibrium constraints is complicated by nonconvex agent problems and therefore providing tractable conditions for existence of global or even local equilibria for it has proved challenging. Consequently, much of the extant research on this topic is either model specific or relies on weaker notions of equilibria. We consider a modified formulation in which every leader is cognizant of the equilibrium constraints of all leaders. Equilibria of this modified game contain the equilibria, if any, of the original game. The new formulation has a constraint structure called shared constraints, and our main result shows that if the leader objectives…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
