Campaign management under approval-driven voting rules

Approval-like voting rules, such as sincere-strategy preference-based approval voting (SP-AV), the Bucklin rule (an adaptive variant of k-approval voting), and the Fallback rule (a hybrid of the Bucklin rule and SP-AV) have many desirable properties: for example, they are easy to understand and enco...

Full description

Bibliographic Details
Main Authors: Schlotter, I, Faliszewski, P, Elkind, E
Format: Journal article
Language:English
Published: Springer 2015
_version_ 1797092225012727808
author Schlotter, I
Faliszewski, P
Elkind, E
author_facet Schlotter, I
Faliszewski, P
Elkind, E
author_sort Schlotter, I
collection OXFORD
description Approval-like voting rules, such as sincere-strategy preference-based approval voting (SP-AV), the Bucklin rule (an adaptive variant of k-approval voting), and the Fallback rule (a hybrid of the Bucklin rule and SP-AV) have many desirable properties: for example, they are easy to understand and encourage the candidates to choose electoral platforms that have a broad appeal. In this paper, we investigate both classic and parameterized computational complexity of electoral campaign management under such rules. We focus on two methods that can be used to promote a given candidate: asking voters to move this candidate upwards in their preference order or asking them to change the number of candidates they approve of. We show that finding an optimal campaign management strategy of the first type is easy for both Bucklin and Fallback. In contrast, the second method is computationally hard even if the degree to which we need to affect the votes is small. Nevertheless, we identify a large class of scenarios that admit fixed-parameter tractable algorithms.
first_indexed 2024-03-07T03:43:08Z
format Journal article
id oxford-uuid:be90491b-3e7c-40f2-814e-808cc183d157
institution University of Oxford
language English
last_indexed 2024-03-07T03:43:08Z
publishDate 2015
publisher Springer
record_format dspace
spelling oxford-uuid:be90491b-3e7c-40f2-814e-808cc183d1572022-03-27T05:40:39ZCampaign management under approval-driven voting rulesJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:be90491b-3e7c-40f2-814e-808cc183d157EnglishSymplectic Elements at OxfordSpringer2015Schlotter, IFaliszewski, PElkind, EApproval-like voting rules, such as sincere-strategy preference-based approval voting (SP-AV), the Bucklin rule (an adaptive variant of k-approval voting), and the Fallback rule (a hybrid of the Bucklin rule and SP-AV) have many desirable properties: for example, they are easy to understand and encourage the candidates to choose electoral platforms that have a broad appeal. In this paper, we investigate both classic and parameterized computational complexity of electoral campaign management under such rules. We focus on two methods that can be used to promote a given candidate: asking voters to move this candidate upwards in their preference order or asking them to change the number of candidates they approve of. We show that finding an optimal campaign management strategy of the first type is easy for both Bucklin and Fallback. In contrast, the second method is computationally hard even if the degree to which we need to affect the votes is small. Nevertheless, we identify a large class of scenarios that admit fixed-parameter tractable algorithms.
spellingShingle Schlotter, I
Faliszewski, P
Elkind, E
Campaign management under approval-driven voting rules
title Campaign management under approval-driven voting rules
title_full Campaign management under approval-driven voting rules
title_fullStr Campaign management under approval-driven voting rules
title_full_unstemmed Campaign management under approval-driven voting rules
title_short Campaign management under approval-driven voting rules
title_sort campaign management under approval driven voting rules
work_keys_str_mv AT schlotteri campaignmanagementunderapprovaldrivenvotingrules
AT faliszewskip campaignmanagementunderapprovaldrivenvotingrules
AT elkinde campaignmanagementunderapprovaldrivenvotingrules