Search 6,000+ CA Community College Courses
Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers

Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Intro

1 of 11
Next

1 of 11

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Intro
  2. 2 What Are Combinatorial Auctions?
  3. 3 Our Problem: Statement
  4. 4 Our Problem: Motivation
  5. 5 Three Trivial Protocols
  6. 6 Barrier to Showing Hardness
  7. 7 New Definition: Truncated Set Cover Valuation
  8. 8 Constructing A and
  9. 9 Extension to Randomized Protocols
  10. 10 Modification of Equality: EXIST-FAR-SETS
  11. 11 Recap and Future Work

Never Stop Learning.

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

Sign up for free
Someone learning on their laptop while sitting on the floor.