(weak) Calibration is Computationally Hard

02/20/2012

∙

by   Elad Hazan, et al.

∙

0

∙

share

We show that the existence of a computationally efficient calibration algorithm, with a low weak calibration rate, would imply the existence of an efficient algorithm for computing approximate Nash equilibria - thus implying the unlikely conclusion that every problem in PPAD is solvable in polynomial time.