The Complexity of Online Bribery in Sequential Elections (Extended Abstract)

07/22/2019
by   Edith Hemaspaandra, et al.
0

Prior work on the complexity of bribery assumes that the bribery happens simultaneously, and that the briber has full knowledge of all voters' votes. But neither of those assumptions always holds. In many real-world settings, votes come in sequentially, and the briber may have a use-it-or-lose-it moment to decide whether to bribe/alter a given vote, and at the time of making that decision, the briber may not know what votes remaining voters are planning on casting. In this paper, we introduce a model for, and initiate the study of, bribery in such an online, sequential setting. We show that even for election systems whose winner-determination problem is polynomial-time computable, an online, sequential setting may vastly increase the complexity of bribery, in fact jumping the problem up to completeness for high levels of the polynomial hierarchy or even PSPACE. On the other hand, we show that for some natural, important election systems, such a dramatic complexity increase does not occur, and we pinpoint the complexity of their bribery problems in the online, sequential setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/19/2019

The Complexity of Online Bribery in Sequential Elections

Prior work on the complexity of bribery assumes that the bribery happens...
research
05/24/2023

A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization

The moment-sum-of-squares (moment-SOS) hierarchy is one of the most cele...
research
06/12/2018

Exponential Weights on the Hypercube in Polynomial Time

We address the online linear optimization problem when the decision set ...
research
10/18/2022

A polynomial-time algorithm to solve the large scale of airplane refueling problem

Airplane refueling problem (ARP) is a scheduling problem with an objecti...
research
07/22/2019

A note on the complexity of a phaseless polynomial interpolation

In this paper we revisit the classical problem of polynomial interpolati...
research
02/02/2021

Majorizing Measures, Sequential Complexities, and Online Learning

We introduce the technique of generic chaining and majorizing measures f...
research
03/04/2019

Sequential Relational Decomposition

The concept of decomposition in computer science and engineering is cons...

Please sign up or login with your details

Forgot password? Click here to reset