(weak) Calibration is Computationally Hard

Details (weak) Calibration is Computationally Hard (weak) Calibration is Computationally Hard

2012-02-20

arxiv.org/abs/1202.4478v1

Computer Science

Computer Science and Game Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

(weak) Calibration is Computationally Hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with (weak) Calibration is Computationally Hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and (weak) Calibration is Computationally Hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-422105