CS 6550/8803: Advanced Algorithms and Uncertainty (original) (raw)
Homework: Homeworks will be posted below when they become available. Submit your solutions on Gradescope. Here is a LaTeX template you may use for the homework, and here is a link to Overleaf if you don't want to install LaTeX on your machine.
Date
Topic
Notes
Jan 10
Introduction and Discrete Optimization
Jan 12
Concentration Inequalities
Jan 17
MLK Jr. National Holiday
Jan 19
Linear Programs, Rounding, and Duality
Jan 24
Convex Optimization and Ellipsoid Algorithm
Jan 26
SDPs and Max-Cut
Online Uncertainty
Jan 31
Intro to Online Algorithms
Feb 2
Online Primal-Dual Algorithms
Feb 7
Hardness: Yao's Minimiax
Feb 9
Random Order Online Problems
Feb 14
Online Learning
Feb 16
Online Convex Optimization
Feb 21
Stochastic and Bandit Gradient Descent
Stochastic Uncertainty
Feb 23
Prophet Inequality and Online Contention Resolution
Feb 28
Markov Decision Process
March 2
Pandora's Box
March 7
Gittins' Index
March 9
ProbeMax and Adaptivity Gaps via LPs
Strategic Uncertainty
March 14
Truthful Combinatorial Auctions
March 16
Bayesian Combinatorial Auctions
March 21 & 23
Spring Break
March 28
Nash Equilibrium
March 30
Price of Anarchy for Routing Games
April 4
Price of Anarchy for Auctions
Lecture 22: see this
April 6
Hardness: Communication Complexity
April 11
Revenue Maximization: Myerson's Single Item Auction
April 13
Bulow-Klemperer and Simple Posted-Pricing
Lecture 25: see this
April 18
Multi-Item Auctions: Single Additive Bidder
Lecture 26: see this paper
April 20
Beyond Nash Equilibrium and No-Regret Dynamics