Slides

Slides and photos of the workshop are now available:

• A Brief Introductory Tutorial on Computational Social Choice Vincent Conitzer
• Different Approaches to Influence in Social Networks Agnieszka Rusinowska
• Some Research Problems in Computational Social Choice Nicolaus Tideman
• Where are the Hard Manipulation Problems? Toby Walsh
• Problem Solving on Simple Games via BDDs Stefan Bolus
• Consensus Measures Generated by Weighted Kemeny Distances on Linear Orders David Pérez-Román
• Collective Attention and Ranking Methods Gabrielle Demange
• Partial Kernelization for Rank Aggregation: Theory and Experiments Robert Bredereck
• On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions Hans Georg Seedig
• Budgeted Social Choice: A Framework for Multiple Recommendations in Consensus Decision Making Tyler Lu
• An Algorithm for the Coalitional Manipulation Problem under Maximin Michael Zuckerman
• An Empirical Study of Borda Manipulation Toby Walsh
• Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods Sylvain Bouveret
• A Maximin Approach to Finding Fair Spanning Trees Christian Klamler
• Approximate Judgement Aggregation Ilan Nehama
• Complexity of Winner Determination and Strategic Manipulation in Judgment Aggregation Umberto Grandi
• Multivariate Complexity Analysis of Swap Bribery Britta Dorn
• Parameterized Control Complexity in Bucklin Voting and in Fallback Voting Gábor Erdélyi
• Cloning in Elections Arkadii Slinko
• Allocation via Deferred-Acceptance under Responsive Priorities Bettina Klaus
• On Problem Kernels for Possible Winner Determination Under the k-Approval Protocol Nadja Betzler
• Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates Markus Brill
• The Efficiency of Fair Division with Connected Pieces Yair Dombb
• Truth, Justice, and Cake Cutting Ariel D. Procaccia
• Online Cake Cutting Toby Walsh
• Impartial Peer Evaluation Hervé Moulin
• Three Hierarchies of Simple Games Parameterized by "Resource" Parameters Tatyana Gvozdeva
• Optimal Partitions in Additively Separable Hedonic Games Haris Aziz
• Fractional Solutions for NTU-Games Péter Biró
• Dependence in Games and Dependence Games Davide Grossi
• Strong Implementation of Social Choice Functions in Dominant Strategies Sven O. Krumke
• A Combinatorial Algorithm for Strong Implementation of Social Choice Functions Clemens Thielen
• Nice, but Are They Relevant? A Political Scientist Looks at Social Choice Results Hannu Nurmi
• Algorithms for Pareto Stable Assignment Arpita Ghosh
• Social Choice without the Pareto Principle under Weak Independence M. Remzi Sanver
• An Optimal Single-Winner Preferential Voting System Based on Game Theory Emily Shen
• Convergence to Equilibria in Plurality Voting Maria Polukarov
• The Probability of Safe Manipulation Mark C. Wilson
• Socially Desirable Approximations for Dodgson's Voting Rule Ioannis Caragiannis
• Approximation Algorithms and Mechanism Design for Minimax Approval Voting Evangelos Markakis
• Group-Strategyproof Irresolute Social Choice Functions Felix Brandt
• Sum of Us: Strategyproof Selection from the Selectors Felix Fischer
• Complexity Consideration on the Existence of Strategy-Proof Social Choice Functions Koji Takamiya