An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions

An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Conclusion

7 of 7

7 of 7

Conclusion

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions

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

  1. 1 Intro
  2. 2 Combinatorial Auction
  3. 3 Prior Results
  4. 4 Beyond Balanced Prices
  5. 5 Equivalent to Key Lemma
  6. 6 Getting O(log log m)
  7. 7 Conclusion

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.