Possible Winners when New Candidates Are Added: The Case of Scoring Rules

Authors

  • Yann Chevaleyre University of Paris-Dauphine
  • Jérôme Lang University of Paris-Dauphine
  • Nicolas Maudet University of Paris-Dauphine
  • Jérôme Monnot University of Paris-Dauphine

DOI:

https://doi.org/10.1609/aaai.v24i1.7640

Keywords:

computational social choice

Abstract

In some voting situations, 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. Focusing on scoring rules, we give complexity results for the above possible winner problem.

Downloads

Published

2010-07-04

How to Cite

Chevaleyre, Y., Lang, J., Maudet, N., & Monnot, J. (2010). Possible Winners when New Candidates Are Added: The Case of Scoring Rules. Proceedings of the AAAI Conference on Artificial Intelligence, 24(1), 762-767. https://doi.org/10.1609/aaai.v24i1.7640

Issue

Section

AAAI Technical Track: Multiagent Systems