On the Robustness of Winners: Counting Briberies in Elections

10/19/2020
by   Niclas Boehmer, et al.
0

We study the parameterized complexity of counting variants of Swap- and Shift-Bribery problems, focusing on the parameterizations by the number of swaps and the number of voters. We show experimentally that Swap-Bribery offers a new approach to the robustness analysis of elections.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/07/2019

On the complexity of counting feedback arc sets

In this note we study the computational complexity of feedback arc set c...
06/08/2021

Complexity classification of counting graph homomorphisms modulo a prime number

Counting graph homomorphisms and its generalizations such as the Countin...
07/02/2018

The Complexity of Approximately Counting Retractions

Let G be a graph that contains an induced subgraph H. A retraction from ...
04/22/2020

Validation of counting methods in bibliometrics

The discussion about counting methods in bibliometrics is often reduced ...
11/27/2018

Counting Polynomial Roots in Isabelle/HOL: A Formal Proof of the Budan-Fourier Theorem

Many problems in computer algebra and numerical analysis can be reduced ...
12/09/2020

Counting methods introduced into the bibliometric research literature 1970-2018: A review

The present review of bibliometric counting methods investigates 1) the ...
05/04/2021

Counting vertices of integer polytopes defined by facets

We present a number of complexity results concerning the problem of coun...