← Search

Alexander Karpov

2 accepted papers

2021

Restricted Domains of Dichotomous Preferences with Possibly Incomplete Information

AAAI 2021technical

Restricted domains over voter preferences have been extensively studied within the area of computational social choice, initially for preferences that are total orders over the set of alternatives and subsequently for preferences that are dichotomous—i.e., that correspond to approved and disapproved…

Cited by 23SourcePDFScholar
2020

The Complexity of Election Problems with Group-Separable Preferences

IJCAI 2020poster

We analyze the complexity of several NP-hard election-related problems under the assumptions that the voters have group-separable preferences. We show that under this assumption our problems typically remain NP-hard, but we provide more efficient algorithms if additionally the clone decomposition tr…

Cited by 0SourcePDFScholar