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.
Authors:
; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10115011
Journal Name:
International Symposium on Algorithmic Game Theory (SAGT)
Volume:
12