Anthony DiGiovanni

Balancing Adaptability and Non-exploitability in Repeated Games

2021 · arXiv (Cornell University)

We study the problem of guaranteeing low regret in repeated games against an opponent with unknown membership in one of several classes. We add the constraint that our algorithm is non-exploitable, in that the opponent …