Algorithms for NP-Hard Problems (Section 24.4: Implementation as a Descending Clock Auction)
Tim Roughgarden Lectures · 28:47
The FCC incentive auction could not run the greedy heuristic directly because stations’ values were unknown and participation had to be voluntary; this lecture shows how a descending clock auction recreates that same...