A New Minimax Theorem for Randomized Algorithms

A New Minimax Theorem for Randomized Algorithms

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Intro

1 of 9

1 of 9

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

A New Minimax Theorem for Randomized Algorithms

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Recall Yao's minimax
  3. 3 Comparison with Yao's minimax
  4. 4 Transcript Interpretation
  5. 5 Standard minimax theorem
  6. 6 A minimax theorem for ratios
  7. 7 Attempt using bias
  8. 8 A special scoring rule
  9. 9 Scoring rules to the rescue!

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.