PhD Theses

This is an (incomplete) list of PhD theses in the field of computational social choice, listed in inverse chronological order. (I welcome suggestions for further additions; just send me an email).

• Joel Uckelman (University of Amsterdam, ILLC, 2009)
  More than the Sum of its Parts: Compact Preference Representation over Combinatorial Domains
  Supervisor: Ulle Endriss
• Haris Aziz (University of Warwick, 2009)
  Algorithmic and Complexity Aspects of Simple Coalitional Games
  Supervisors: Mike Paterson and Dennis Leech
• Piotr Faliszewski (University of Rochester, 2008)
  Manipulation of Elections: Algorithms and Infeasibility Results
  Supervisor: Lane A. Hemaspaandra
• Ariel Procaccia (Hebrew University of Jerusalem, 2008)
  Computational Voting Theory: Of the Agents, By the Agents, For the Agents
  Supervisor: Jeff Rosenschein
• Rob LeGrand (Washington University in St. Louis, 2008)
  Computational Aspects of Approval Voting and Declared-Strategy Voting
  Supervisor: Ron K. Cytron
• Sylvain Bouveret (ISAE Toulouse and University of Toulouse, 2007)
  Allocation et Partage Equitables de Ressources Indivisibles: Modélisation, Complexité et Algorithmique
  Supervisors: Jean-Michel Lachiver, Jérôme Lang and Michel Lemaître
• Alon Altman (Technion, 2007)
  The Axiomatic Approach to Ranking Systems
  Supervisor: Moshe Tennenholtz
• Maria Silvia Pini (University of Padova, 2007)
  Reasoning with Preferences and Uncertainty
  Supervisor: Francesca Rossi
• Sylvia Estivie (Université Paris Dauphine, LAMSADE, 2006)
  Allocation de Ressources Multi-Agents: Théorie et Pratique
  Supervisors: Yann Chevaleyre and Nicolas Maudet
• Vincent Conitzer (Carnegie Mellon University, 2006)
  Computational Aspects of Preference Aggregation
  Supervisor: Tuomas Sandholm