Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions

NeurIPS 2019 Gabriele FarinaChristian KroerTuomas Sandholm

We study the performance of optimistic regret-minimization algorithms for both minimizing regret in, and computing Nash equilibria of, zero-sum extensive-form games. In order to apply these algorithms to extensive-form games, a distance-generating function is needed... (read more)

PDF Abstract

Code


No code implementations yet. Submit your code now

Tasks


Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.