New Candidates Welcome! Possible Winners with respect to the Addition of New Candidates

11/15/2011
by   Yann Chevaleyre, et al.
0

In voting contexts, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed number k of new candidates will be added. We give a computational study of this problem, focusing on scoring rules, and we provide a formal comparison with related problems such as control via adding candidates or cloning.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/28/2014

Elections with Few Voters: Candidate Control Can Be Easy

We study the computational complexity of candidate control in elections ...
research
05/04/2023

Strategic flip-flopping in political competition

We study candidates' positioning when adjustments are possible in respon...
research
02/15/2019

Electing a committee with dominance constraints

We consider the problem of electing a committee of k candidates, subject...
research
11/18/2022

Pandering in a Flexible Representative Democracy

In representative democracies, the election of new representatives in re...
research
07/02/2022

Separating and Collapsing Electoral Control Types

[HHM20] discovered, for 7 pairs (C,D) of seemingly distinct standard ele...
research
11/15/2022

Improving AFL++ CmpLog: Tackling the bottlenecks

The performance of the AFL++ CmpLog feature varies considerably for spec...
research
03/14/2019

Accumulation charts for instant-runoff elections

We propose a new graphical format for instant-runoff voting election res...

Please sign up or login with your details

Forgot password? Click here to reset