1 Her work has been supported in part by an NRW grant for gender-sensitive universities
supporting her as a junior professor for Computational Social Choice and by the project …

In this paper we propose a new framework for analyzing the performance of preprocessing
algorithms. Our framework builds on the notion of kernelization from parameterized …

Many fundamental NP NP-hard problems can be formulated as integer linear programs
(ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential only in the …

Collective decision making is concerned with aggregating information reported by a number
of individuals into a collective decision appropriately capturing the individual views as a …

We introduce a general problem about bribery in voting systems. In the R-Multi-Bribery
problem, the goal is to bribe a set of voters at minimum cost such that a desired candidate is …

We thoroughly study a generalized version of the famous Stable Marriage problem, now
based on multi-modal preference lists. The central twist herein is to allow each agent to rank …

Computational Social Choice is an interdisciplinary research area involving Economics,
Political Science, and Social Science on the one side, and Mathematics and Computer …

Abstract In the Shift Bribery problem, we are given an election, a preferred candidate p, and
a budget. The goal is to ensure p's victory by shifting p higher in some voters' preference …

Abstract Endriss et al.(2012) initiated the complexity-theoretic study of problems related to
judgment aggregation. We extend their results on the manipulation of two specific judgment …

We study the complexity of a combinatorial variant of the SHIFT BRIBERY problem in
elections. In the standard SHIFT BRIBERY problem, we are given an election where each …