hu / en

Schlotter Ildikó és szerzőtársai cikke megjelent az Autonomous Agents and Multi-Agent Systems szakfolyóiratban

 

Parameterized complexity of candidate nomination
for elections based on positional scoring rules

 
Ildikó Schlotter – Katarína Cechlárová – Diana Trellová
Original Paper – Open access – 1 July 2024 
 
 
 
 

Abstract

Consider elections where the set of candidates is partitioned into parties, and each party must nominate exactly one candidate. The Possible President problem asks whether some candidate of a given party can become the unique winner of the election for some nominations from other parties. We perform a multivariate computational complexity analysis of Possible President for several classes of elections based on positional scoring rules. We consider the following parameters: the size of the largest party, the number of parties, the number of voters and the number of voter types. We provide a complete computational map of Possible President in the sense that for each choice of the four possible parameters as (i) constant, (ii) parameter, or (iii) unbounded, we classify the computational complexity of the resulting problem as either polynomial-time solvable or NP-complete, and for parameterized versions as either fixed-parameter tractable or W[1]-hard with respect to the parameters considered.

 
 
 
 

2024

Júl

18

H

K

Sz

Cs

P

Sz

V

1

2

3

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

1

2

3

4

Következő hónap >