Program

We will have 9 full presentations of 20 minutes each with 10 minutes for discussion.  We will also have two tutorials about exciting tools in EXPLORing beyond the worst case in computational social choice.

Time
Presentation
9:00 - 10:00Tutorial: PrefLib for Empirical Testing in Social Choice.
Nicholas Mattei (NICTA and UNSW).

Slides and Code.
10:00 - 10:30On the Discriminative Power of Tournament Solutions.
Felix Brandt, (Technische Universitat Munchen)
Hans Georg Seedig, (Technische Universitat Munchen)
10:30 - 11:00Coffee Break
11:00 - 11:30Approximate Winner Selection in Social Choice with Partial Preferences
John A. Doucette, (Canada University of Waterloo)
Kate Larson, (Canada University of Waterloo)
Robin Cohen, (Canada University of Waterloo)
11:30 - 12:00Controlling Elections by Replacing Candidates for Plurality and Veto: Theoretical and Experimental Results 
Andrea Loreggia, (University of Padova)
Nina Narodytska, (University of Toronto and UNSW)
Francesca Rossi, (University of Padova)
Kristen Brent Venable, (Tulane University and IHMC)
Toby Walsh, (NICTA and UNSW)
12:00 - 12:30The Computational Rise and Fall of Fairness
John Dickerson, (Carnegie Mellon University)
Jonathan Goldman, (Carnegie Mellon University)
Jeremy Karp,  (Carnegie Mellon University)
Ariel Procaccia, (Carnegie Mellon University)
Tuomas Sandholm, (Carnegie Mellon University)
12:30 - 14:00Lunch
14:00 - 15:00Tutorial: Parameterized Complexity and its Use in Computational Social Choice.
Joerg Rothe (Heinrich Heine University of Düsseldorf).

Slides.
15:00 - 15:30Election Attacks with Few Candidates
Yongjie Yang, (Germany Universitat des Saarlandes)
15:30 - 16:00Coffee Break
16:00 - 16:30The Maximum Likelihood Approach to Voting on Social Networks
Vincent Conitzer, (Duke University).
16:30 - 17:00Analysis of Equilibria in Iterative Voting Schemes
Zinovi Rabinovich, (Mobileye Vision Technologies Ltd.)
Svetlana Obraztsova, (NTUA)
Omer Lev, (Hebrew University of Jerusalem)
Evangelos Markakis, (Athens University of Economics and Business)
Jeffrey Rosenschein, (Hebrew University of Jerusalem)
17:00 - 17:30Identifying k-Majority Digraphs via SAT Solving
Felix Brandt, (Technische Universitat Munchen)
Christian Geist, (Technische Universitat Munchen)
Hans Georg Seedig, (Technische Universitat Munchen)
17:30 - 18:00Voting with Rank Dependent Scoring Rules
Jerome Lang, (LAMSADE, University Paris-Dauphine)
Judy Goldsmith, (University of Kentucky)
Nicholas Mattei, (NICTA and UNSW)
Patrice Perny, (LIP6, UPMC)