Theory Seminar

Fall 2011 - CS 7890

*All seminars held in 5130 Upson Hall at 4:00 pm unless otherwise noted*

Date & Time Speaker Title Host
August 24, 2011(Please note this is a Wed.) Ron Lavi, Technion Efficiency of Sequential English Auctions with Dynamic Arrivals Robert Kleinberg
September 6, 2011 (Please note this is a Tuesday) Elliot Anshelevich, Rensselaer Polytechnic Institute Contribution Games in Social Networks Robert Kleinberg
September 12, 2011 Nicole Immorlica, Northwestern Univ. On the Impossibility of Black-Box Transformations in Mechanism Design Robert Kleinberg
September 14, 2011******Please note - talk is at 10:00am Wed, Sept 14th****** Jason Hartline, Northwestern University Theory of Crowdsourcing Contests David Shmoys
September 19, 2011 David Kempe, USC Frugal Auctions For Vertex Covers, Flows, and Cuts Robert Kleinberg
September 26, 2011 Kai-Min Chung, Cornell

The Randomness Complexity of Parrallel Repetition

Rafael Pass

October 3, 2011 Sigal Oren, Cornell University How Bad is Forming Your Own Opinion? Robert Kleinberg
October 10, 2011 No Theory Seminar Fall Break  
October 17, 2011 Shahar Dobzinski, Cornell University (Approximating) Optimal Auctions with Correlated Bidders Robert Kleinberg
October 24, 2011   Cancelled because of FOCS  
October 31, 2011 Per Austrin, University of Toronto Inapproximability of Treewidth and Related Problems Rafael Pass

November 7, 2011 (Joint meeting with Microeconomic and CS Theory Seminars)

Please arrive a few minutes early as room fills up fast.***URIS HALL 498 4:30-6:00*******

Michael Schwartz, Yahoo! Research

TBA Aaron Bodoh-Creed
November 15, 2011****Please note- talk is on a Tuesday*****5130 Upson Hall 4:00pm**** Moshe Babaioff, Microsoft Research

“Peaches, Lemons, and Cookies: Designing Auction Markets with Dispersed Information”

Robert Kleinberg
November 21, 2011 Jonathan Kelner, MIT Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs Robert Kleinberg
November 28, 2011 Bobby Kleinberg, Cornell University Which Networks are Least Susceptible to Cascading Failures? Robert Kleinberg
December 5, 2011 Anke van Zuylen, Max Planck Institute The Subtour LP for the Traveling Salesman Problem: On the Integrality Gap of the 1,2-TSP David Williamson

To receive email announcements about the Theory Seminar, subscribe to our mail list at



Spring 2011 | Fall 2010 | Spring 2010 | Fall 2009 | Spring 2009 |
Fall 2008 | Spring 2008 | Fall 2007 | Spring 2007 | Fall 2006