@COMMENT This file was generated by bib2html.pl <https://sourceforge.net/projects/bib2html/> version 0.94
@COMMENT written by Patrick Riley <http://sourceforge.net/users/patstg/>
@COMMENT This file came from Nicolas Maudet's publication pages at
@COMMENT http://www.lamsade.dauphine.fr/~maudet/publications/
@inproceedings{ChevaleyreEtAlAAAI2010,
  author =        {Yann Chevaleyre and J\'er\^ome Lang and Nicolas Maudet and J\'er\^ome Monnot},
  title =         {Possible Winners when New Candidates are Added: the case of scoring rules},
  booktitle =     {Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI-2010)},
  month =         {July},
  year =          {2010},
  OPTpages =          {}, 
 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.}
}