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

@article{Chevaleyre2012NewCW,
  title={New Candidates Welcome! Possible Winners with respect to the Addition of New Candidates},
  author={Y. Chevaleyre and J. Lang and N. Maudet and J. Monnot and Lirong Xia},
  journal={ArXiv},
  year={2012},
  volume={abs/1111.3690}
}
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. 
Possible winners when new alternatives join: new results coming up!
Computational complexity of two variants of the possible winner problem
The Possible Winner Problem with Uncertain Weights
Possible Winners in Approval Voting
The complexity of controlling candidate-sequential elections
Robust Winners and Winner Determination Policies under Candidate Uncertainty
Possible and necessary winners of partial tournaments
Committee Voting with Incomplete Approvals
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 54 REFERENCES
Computational complexity of two variants of the possible winner problem
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
Voting procedures with incomplete preferences
A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
Compiling the votes of a subelectorate
Probabilistic Possible Winner Determination
...
1
2
3
4
5
...