Technology, Artificial Intelligence, Machine Learning, Marketing, Data Science.
step towards closing this gap by first showing that — barring major complexity breakthroughs — any polynomial-time learning algorithms in extensive-form games need at least 2log1/2−o(1)|T| iterations for the average regret to reach below even an absolute constant, where |T| is the number of nodes