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 …

Tournaments are commonly used to select winning alternatives in scenarios involving
pairwise comparisons such as sports competitions and political elections. This survey …

Most solution concepts in collective decision making are defined assuming complete
knowledge of individuals' preferences and of the mechanism used for aggregating them …

We study the problem of computing possible and necessary winners for partially specified
weighted and unweighted tournaments. This problem arises naturally in elections with …

Tournament solutions are frequently used to select winners from a set of alternatives based
on pairwise comparisons between them. Prior work has shown that several common …

We investigate the complexity of r-Approval control problems in k-peaked elections, where at
most k peaks are allowed in each vote with respect to an order of the candidates. Our study …

Tournament solutions are standard tools for identifying winners based on pairwise
comparisons between competing alternatives. The recently studied notion of margin of …

We study strategic voting problems for majority judgment, in which each voter assigns to
every candidate a grade and the winners are determined by their majority-grades. We first …

In this paper, we study the computational complexity of several problems pertaining to the
model of group identification. In group identification, a set of agents try to determine who …

A tournament graph over n players is weakly transitive at player p if it contains a Hamiltonian
path\left (p_ 1, p_ 2,\dots, p_ n\right) p 1, p 2,⋯, pn with p_ 1= pp 1= p such that for all odd …