@report {1616776,
	title = {(weak) Calibration is Computationally Hard},
	year = {2012},
	institution = {ArXiv Report},
	address = {Conference on Learning Theory (COLT)},
	abstract = {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.},
	url = {http://arxiv.org/abs/1202.4478},
	author = {Elad Hazan and Sham M. Kakade}
}
