There exist several polynomial-time algorithms for computing CEs and CCEs. This paper focuses on the leading approach for large games: regret minimization algorithms. In addition to their theoretical guarantees of convergence to equilibria, regret minimization algorithms have been behind recent empirical successes in large-scale game benchmarks such as many forms of poker (including non-two-player poker) [1]}, [2]}, [3]}, [4]}, Avalon [5]}, and Diplomacy [6]}.
