An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions
Offered By: IEEE via YouTube
Course Description
Overview
Explore an advanced algorithm for subadditive combinatorial auctions in this 26-minute IEEE conference talk. Delve into the intricacies of the O(log log m) prophet inequality as presented by experts Paul Duetting, Thomas Kesselheim, and Brendan Lucier. Learn about combinatorial auctions, prior results, and the concept of balanced prices. Discover how to go beyond these prices and understand the key lemma equivalent. Gain insights into achieving O(log log m) complexity and grasp the implications of this research in the field of algorithmic game theory and auction design.
Syllabus
Intro
Combinatorial Auction
Prior Results
Beyond Balanced Prices
Equivalent to Key Lemma
Getting O(log log m)
Conclusion
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Game Theory and EconomicsNPTEL via YouTube The Communication Complexity of Truthful vs Non-Truthful Combinatorial Auctions
Association for Computing Machinery (ACM) via YouTube Tropical Solutions to Hard Problems in Auction Theory
Hausdorff Center for Mathematics via YouTube Tropical Solutions to Hard Problems in Auction Theory and Neural Networks - Lecture II
Hausdorff Center for Mathematics via YouTube Tropical Solutions to Hard Problems in Auction Theory and Neural Networks - Lecture I
Hausdorff Center for Mathematics via YouTube