(*= co-supervised)

Doctoral StudentsVishnu Narayan Mete Ahunbay Mashbat Suzuki* Nithum Thain Bundit Laekhanukit Ethan Kim* Zhentao Li* Neil Olver* Nicolas Sonnerat* Masters StudentsGuatam Rayaprolu Ling Zhang* Shant Boodaghians Muhammad Khan* Yogesh Anbalagan Huining Hu Peter Sloan Nithum Thain Greg Costain Matt Drescher Daniel Simeone* Neil Olver Christina Boucher Nadia Hardy Chris Wu |
Dates CurrentCurrentCurrent2008-10, 13-152010-142007-112007-112006-102005-10 DatesCurrentCurrent2015-162013-152012-142012-142010-132006-082006-082005-072005-072005-062004-052004-052003-04 |
Thesis TitleAlgorithmic Game Theory Algorithmic Game Theory Algorithmic Game Theory "Algorithmic approaches to oligopoly theory." "Inapproximability of combinatorial problems in subexponential-time." "Deconvolution of protein-protein interactions networks: approximation algorithms and optimization techniques." "Tree decompositions and linear time algorithms." "Robust network design." "Galaxy cutsets and graph connectivity: variations on a theme." Thesis TitleAlgorithmic Game Theory. Algorithmic Game Theory. "Two relaxations of revealed preference activity rules, and implementations". "Minimum communication cost spanning trees and metric embeddings". "Approximate well supported Nash equilibria in win-lose bimatrix games." "Experiment design to discover the structure of causal graph." "The social welfare of core-selecting mechanisms." "On the transversal matroid secretary problem." "On the additive graph generated by a subset of the numbers." "An approximation algorithm for the maximum leaf arborescence problem." "Network connectivity: a tree decomposition approach." "The price of anarchy and a priority-based model of routing." "A study into the inefficiency of traffic flows induced by selfish agents." "Odd cycles in planar graphs." "Combinatorial auctions: allocation and communication." |