Ph.D. Dissertations - Christos Papadimitriou

Algorithmic Mechanism Design in Dynamic Environments
Christos-Alexandros Psomas [2017]

Hardness of Approximation Between P and NP
Aviad Rubinstein [2017]

Economics and Computation: Ad Auctions and Other Stories
Christopher Wilkens [2013]

Eliciting Private Information from Selfish Agents
Rafael Frongillo [2013]

The Complexity of Optimal Auction Design
George Pierrakos [2013]

Algorithmic Approaches to Statistical Questions
Gregory Valiant [2012]

Incentives, Computation, and Networks: Limitations and Possibilities of Algorithmic Mechanism Design
Yaron Singer [2012]

Internet Routing and Internet Service Provision
Henry Lin [2009]

Complexity of Game Dynamics
Alex Fabrikant [2008]

The Complexity of Nash Equilibria
Constantinos Daskalakis [2008]

Learning Mixtures of Distributions
Kamalika Chaudhuri [2007]

Geometric Embeddings, Geometric Algorithms, and Combinatorial Optimization
James R. Lee [2006]

Revenue Maximization in Online Auctions
Felix T.-S. Wu [2005]

Metric Methods in Approximation Algorithms
Kunal Talwar [2004]

Communities and Reputation on the Web
David A. Gibson [2002]

The Complexity of Massive Data Set Computations
Ziv Bar-Yossef [2002]

Approximability and Completeness in the Polynomial Hierarchy
Christopher M. Umans [2000]

Communication in Hierarchies: Explaining Deadlines
Edouard L. Servan-Schreiber [2000]

Maximizing Throughput of Reliable Bulk Network Transmissions
John W. Byers [1997]