- CS364A: Problem Set #3 Due in class on Thursday, November 6, 2008
- CS369B: Problem Set #4 Due in class on Thursday, March 6, 2008
- CS364A: Problem Set #4 Due in class on Thursday, November 20, 2008
- CS364A: Take-Home Final Due to Peerapong in Gates 460 by 3:30 PM on Thursday, March 17, 2011
- A Stronger Bound on Braess's Paradox Henry Lin Tim Roughgarden
- Bottleneck Links, Variable Demand, and the Tragedy of the Commons
- Lectures on Combinatorial Auctions # Tim Roughgarden +
- CS369N: Beyond Worst-Case Analysis Lecture #3: Deterministic Planted Models for
- CS369B: Take-Home Final Due by 10PM on Thursday, March 20, 2008
- Pricing Networks with Selfish Routing Richard Cole
- Worst-Case Efficiency Analysis of Queueing Disciplines
- THEORY OF COMPUTING www.theoryofcomputing.org
- Revenue Submodularity Shaddin Dughmi
- Truthful Approximation Schemes for Single-Parameter Agents Peerapong Dhangwatnotai
- Designing Network Protocols for Good Equilibria Ho-Lin Chen
- An Interview with Vladimir Trifonov (2005 Danny Lewin Best Student Paper Award Winner)
- Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
- How Much Can Taxes Help Selfish Routing? Richard Cole
- How Unfair is Optimal Routing? Tim Roughgarden
- Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
- CS364A: Problem Set #1 Due in class on Thursday, January 20, 2011
- CS364A: Problem Set #4 Due in class on Thursday, March 3, 2011
- CS369N: Beyond Worst-Case Analysis Lecture #9: From Average-Case Analysis to Instance
- On the Convergence of Regret Minimization Dynamics in Concave Eyal Even-Dar
- CS369N: Problem Set #2 Due in class on Friday, November 13, 2009
- CS364A: Problem Set #1 Due in class on Thursday, October 9, 2008
- CS364A: Problem Set #2 Due in class on Thursday, October 23, 2008
- CS364A: Take-Home Final Due to Peerapong in Gates 460 by 6:30 PM on Thursday, December 11, 2008
- The Lovely but Lonely Vickrey Auction Lawrence M. Ausubel and Paul Milgrom
- CS369B: Problem Set #1 Due in class on Thursday, January 24, 2008
- CS359D, Winter 2007 PCP Theorem Quick Reference Sheet
- Bounds on the Price of Anarchy in the KP Model CS 364A Algorithmic Game Theory, Fall 2004
- AdWords and Generalized On-line Matching Aranyak Mehta Amin Saberi Umesh Vazirani Vijay Vazirani
- CS364A: Problem Set #1 Due in class on Tuesday, October 26, 2004
- CS364A: Problem Set #2 Due in class on Thursday, November 18, 2004
- Network Design with Weighted Players Ho-Lin Chen
- CS369B: Problem Set #3 Due in class on Thursday, February 21, 2008
- Routers with very small buffers Mihaela Enachescu
- Cost of Conciseness in Sponsored Search Auctions Zoe Abrams
- SELFISH ROUTING A Dissertation
- A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem
- On total functions, existence theorems and computational
- CS364A: Problem Set #3 Due in class on Thursday, February 17, 2011
- Lectures on Combinatorial Auctions Tim Roughgarden
- CS364A: Problem Set #1 Due in class on Thursday, October 19, 2006
- CS364A: Problem Set #2 Due in class on Tuesday, November 7, 2006
- CS364A: Problem Set #2 Due in class on Thursday, February 3, 2011
- The Price of Anarchy in an Exponential Multi-Server Moshe Haviv
- On a Game in Directed Graphs Alan J. Hoffman
- CS364A: Problem Set #3 Due in class on Thursday, November 30, 2006
- CS369N: Beyond Worst-Case Analysis Lecture #5: Self-Improving Algorithms
- Simpler and Better Approximation Algorithms for Network Anupam Gupta
- Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
- CS369B: Problem Set #2 Due in class on Thursday, February 7, 2008
- CS369N: Beyond Worst-Case Analysis Lecture #4: Probabilistic and Semirandom Models for
- Pricing Network Edges for Heterogeneous Selfish Users Richard Cole
- CS369N: Beyond Worst-Case Analysis Lecture #1: Instance Optimality
- Is Efficiency Expensive? Tim Roughgarden
- CS369N: Problem Set #3 Due to Qiqi Yan by 11:30 AM on Thursday, December 10, 2009
- Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem
- CS369N: Beyond Worst-Case Analysis Lecture #2: Models of Data in Online Paging
- CS369N: Problem Set #1 Due in class on Friday, October 23, 2009
- Sketching Valuation Functions Ashwinkumar Badanidiyuru
- Uncoupled Potentials for Proportional Allocation Markets Uri Nadav, Ramesh Johari, and Tim Roughgarden
- CS369N: Beyond Worst-Case Analysis Lecture #6: Pseudorandom Data and Universal Hashing
- CS369N: Beyond Worst-Case Analysis Lecture #7: Smoothed Analysis
- CS369N: Beyond Worst-Case Analysis Lecture #8: Resource Augmentation
