Please help transcribe this video using our simple transcription tool. You need to be logged in to do so.


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.

Questions and Answers

You need to be logged in to be able to post here.