The paper presents an algorithm for solving online Stackelberg games in a follower-agnostic manner. It introduces a unique gradient estimator and departure from traditional assumptions for realistic interactions. The algorithm converges to a local Stackelberg equilibrium and is validated on a transportation network problem.
To Another Language
from source content
arxiv.org
Key Insights Distilled From
by Chinmay Mahe... at arxiv.org 03-28-2024
https://arxiv.org/pdf/2302.01421.pdfDeeper Inquiries