CombOpt Reading Group
CombOpt Reading Group
About
Upcoming Talks
Recent Talks
Topics
Archive
Light
Dark
Automatic
An O(log log m) prophet inequality for subadditive combinatorial auctions
Rian Neogi
Abstract
Date
Nov 29, 2024 1:30 PM
Location
MC6029
Topic
Game Theory
Cite
×