Decentralized poly-time algorithms achieve (1-1/e)-approximate assistance regret Õ(T^{3/4}) (or Õ(√T) with shared randomness) for online assistance games, and better approximation is intractable.
Learning and approximating the optimal strategy to commit to
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Provably Optimal Learning Algorithms for Assistance Games
Decentralized poly-time algorithms achieve (1-1/e)-approximate assistance regret Õ(T^{3/4}) (or Õ(√T) with shared randomness) for online assistance games, and better approximation is intractable.