Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Sasty, S. Shankar"'
In this paper, we present an efficient algorithm to solve online Stackelberg games, featuring multiple followers, in a follower-agnostic manner. Unlike previous works, our approach works even when leader has no knowledge about the followers' utility
Externí odkaz:
http://arxiv.org/abs/2302.01421
