{"id":11,"date":"2013-12-03T03:13:40","date_gmt":"2013-12-03T03:13:40","guid":{"rendered":"http:\/\/www.preflib.org\/beyond2014\/?page_id=11"},"modified":"2014-04-16T05:40:51","modified_gmt":"2014-04-16T05:40:51","slug":"program","status":"publish","type":"page","link":"http:\/\/www.explore14.preflib.org\/?page_id=11","title":{"rendered":"Program"},"content":{"rendered":"

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

\n\n\n\n\t\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t
Time<\/th>Presentation<\/th>\n<\/tr>\n<\/thead>\n
9:00 - 10:00<\/td>Tutorial: PrefLib<\/a> for Empirical Testing in Social Choice.
\nNicholas Mattei<\/a> (NICTA and UNSW).
\n
\nSlides<\/a> and Code<\/a>.<\/td>\n<\/tr>\n
10:00 - 10:30<\/td>On the Discriminative Power of Tournament Solutions<\/a>.
\nFelix Brandt, (Technische Universitat Munchen)
\nHans Georg Seedig, (Technische Universitat Munchen)
\n<\/td>\n<\/tr>\n
10:30 - 11:00<\/td>Coffee Break<\/td>\n<\/tr>\n
11:00 - 11:30<\/td>Approximate Winner Selection in Social Choice with Partial Preferences<\/a>
\nJohn A. Doucette, (Canada University of Waterloo)
\nKate Larson, (Canada University of Waterloo)
\nRobin Cohen, (Canada University of Waterloo)<\/td>\n<\/tr>\n
11:30 - 12:00<\/td>Controlling Elections by Replacing Candidates for Plurality and Veto: Theoretical and Experimental Results\u00a0<\/a>
\nAndrea Loreggia, (University of Padova)
\nNina Narodytska, (University of Toronto and UNSW)
\nFrancesca Rossi, (University of Padova)
\nKristen Brent Venable, (Tulane University and IHMC)
\nToby Walsh, (NICTA and UNSW)<\/td>\n<\/tr>\n
12:00 - 12:30<\/td>The Computational Rise and Fall of Fairness<\/a>
\nJohn Dickerson, (Carnegie Mellon University)
\nJonathan Goldman, (Carnegie Mellon University)
\nJeremy Karp, \u00a0(Carnegie Mellon University)
\nAriel Procaccia, (Carnegie Mellon University)
\nTuomas Sandholm, (Carnegie Mellon University)<\/td>\n<\/tr>\n
12:30 - 14:00<\/td>Lunch<\/td>\n<\/tr>\n
14:00 - 15:00<\/td>Tutorial: Parameterized Complexity and its Use in Computational Social Choice.
\nJoerg Rothe<\/a> (Heinrich Heine University of D\u00fcsseldorf).
\n
\nSlides<\/a>.<\/td>\n<\/tr>\n
15:00 - 15:30<\/td>Election Attacks with Few Candidates<\/a>
\nYongjie Yang, (Germany Universitat des Saarlandes)
\n<\/td>\n<\/tr>\n
15:30 - 16:00<\/td>Coffee Break<\/td>\n<\/tr>\n
16:00 - 16:30<\/td>The Maximum Likelihood Approach to Voting on Social Networks<\/a>
\nVincent Conitzer, (Duke University).<\/td>\n<\/tr>\n
16:30 - 17:00<\/td>Analysis of Equilibria in Iterative Voting Schemes<\/a>
\nZinovi Rabinovich, (Mobileye Vision Technologies Ltd.)
\nSvetlana Obraztsova, (NTUA)
\nOmer Lev, (Hebrew University of Jerusalem)
\nEvangelos Markakis, (Athens University of Economics and Business)
\nJeffrey Rosenschein, (Hebrew University of Jerusalem)<\/td>\n<\/tr>\n
17:00 - 17:30<\/td>Identifying k-Majority Digraphs via SAT Solving<\/a>
\nFelix Brandt, (Technische Universitat Munchen)
\nChristian Geist, (Technische Universitat Munchen)
\nHans Georg Seedig, (Technische Universitat Munchen)<\/td>\n<\/tr>\n
17:30 - 18:00<\/td>Voting with Rank Dependent Scoring Rules<\/a>
\nJerome Lang, (LAMSADE, University Paris-Dauphine)
\nJudy Goldsmith, (University of Kentucky)
\nNicholas Mattei, (NICTA and UNSW)
\nPatrice Perny, (LIP6, UPMC)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"

We will have 9 full presentations of 20 minutes each with 10 minutes for discussion. \u00a0We will also have two tutorials about exciting tools in EXPLORing beyond the worst case in computational social choice.<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/www.explore14.preflib.org\/index.php?rest_route=\/wp\/v2\/pages\/11"}],"collection":[{"href":"http:\/\/www.explore14.preflib.org\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/www.explore14.preflib.org\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/www.explore14.preflib.org\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.explore14.preflib.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=11"}],"version-history":[{"count":9,"href":"http:\/\/www.explore14.preflib.org\/index.php?rest_route=\/wp\/v2\/pages\/11\/revisions"}],"predecessor-version":[{"id":80,"href":"http:\/\/www.explore14.preflib.org\/index.php?rest_route=\/wp\/v2\/pages\/11\/revisions\/80"}],"wp:attachment":[{"href":"http:\/\/www.explore14.preflib.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=11"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}