skip to main content


Title: Computing Stackelberg Equilibria of Large General-Sum Games
We study the computational complexity of finding Stackelberg Equilibria in general-sum games, where the set of pure strategies of the leader and the followers are exponentially large in a natural representation of the problem.  more » « less
Award ID(s):
1733556
NSF-PAR ID:
10115011
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
International Symposium on Algorithmic Game Theory (SAGT)
Volume:
12
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found