Near-optimal no-regret algorithms for zero-sum games.

Constantinos Daskalakis Alan Deckelbaum Anthony Kim

Published in: Games Econ. Behav. (2015)

Keyphrases

theoretical analysis
worst case
computational cost
times faster
learning algorithm
data structure
computational complexity
lower bound
significant improvement
computationally efficient
orders of magnitude
machine learning
multi agent systems
loss function
recently developed