Search versus Search for Collapsing Electoral Control Types

07/07/2022
by   Benjamin Carleton, et al.
0

Electoral control types are ways of trying to change the outcome of elections by altering aspects of their composition and structure [BTT92]. We say two compatible (i.e., having the same input types) control types that are about the same election system E form a collapsing pair if for every possible input (which typically consists of a candidate set, a vote set, a focus candidate, and sometimes other parameters related to the nature of the attempted alteration), either both or neither of the attempted attacks can be successfully carried out [HHM20]. For each of the seven general (i.e., holding for all election systems) electoral control type collapsing pairs found by Hemaspaandra, Hemaspaandra, and Menton [HHM20] and for each of the additional electoral control type collapsing pairs of Carleton et al. [CCH+ 22] for veto and approval (and many other election systems in light of that paper's Theorems 3.6 and 3.9), both members of the collapsing pair have the same complexity since as sets they are the same set. However, having the same complexity (as sets) is not enough to guarantee that as search problems they have the same complexity. In this paper, we explore the relationships between the search versions of collapsing pairs. For each of the collapsing pairs of Hemaspaandra, Hemaspaandra, and Menton [HHM20] and Carleton et al. [CCH+ 22], we prove that the pair's members' search-version complexities are polynomially related (given access, for cases when the winner problem itself is not in polynomial time, to an oracle for the winner problem). Beyond that, we give efficient reductions that from a solution to one compute a solution to the other. For the concrete systems plurality, veto, and approval, we completely determine which of their (due to our results) polynomially-related collapsing search-problem pairs are polynomial-time computable and which are NP-hard.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/02/2022

Separating and Collapsing Electoral Control Types

[HHM20] discovered, for 7 pairs (C,D) of seemingly distinct standard ele...
research
02/17/2021

The Complexity of Gerrymandering Over Graphs: Paths and Trees

Roughly speaking, gerrymandering is the systematic manipulation of the b...
research
06/29/2022

Linearizing Partial Search Orders

In recent years, questions about the construction of special orderings o...
research
06/26/2023

An FPT Algorithm for Splitting a Necklace Among Two Thieves

It is well-known that the 2-Thief-Necklace-Splitting problem reduces to ...
research
07/18/2023

Polynomial Time and Dependent Types

We combine dependent types with linear type systems that soundly and com...
research
11/13/2018

Very Hard Electoral Control Problems

It is important to understand how the outcome of an election can be modi...
research
07/08/2018

Graduality from Embedding-projection Pairs (Extended Version)

Gradually typed languages allow statically typed and dynamically typed c...

Please sign up or login with your details

Forgot password? Click here to reset