GI LogoGI Logo
  • Login
Digital Library
    • All of DSpace

      • Communities & Collections
      • Titles
      • Authors
      • By Issue Date
      • Subjects
    • This Collection

      • Titles
      • Authors
      • By Issue Date
      • Subjects
Digital Library Gesellschaft für Informatik e.V.
GI-DL
    • English
    • Deutsch
  • English 
    • English
    • Deutsch
View Item 
  •   DSpace Home
  • Lecture Notes in Informatics
  • Proceedings
  • BTW - Datenbanksysteme für Business, Technologie und Web
  • P266 - BTW2017 - Datenbanksysteme für Business, Technologie und Web - Workshopband
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
  •   DSpace Home
  • Lecture Notes in Informatics
  • Proceedings
  • BTW - Datenbanksysteme für Business, Technologie und Web
  • P266 - BTW2017 - Datenbanksysteme für Business, Technologie und Web - Workshopband
  • View Item

Possible Voter Control in k-Approval and k-Veto Under Partial Information

Author:
Erdélyi, Gábor [DBLP] ;
Reger, Christian [DBLP]
Abstract
We study the complexity of possible constructive/destructive control by adding voters (PCCAV/PDCAV) and deleting voters (PCCDV/PDCDV) under nine different models of partial information for k-Approval and k-Veto. For the two destructive variants, we can further settle a polynomial-time result holding even for each scoring rule. Generally, in voter control, an external agent (called the chair) tries to change the outcome of the election by adding new voters to the elec- tion or by deleting voters from the election. Usually there is full information in voting theory, i.e., the chair knows the candidates, each voter’s complete ranking about the candidates and the voting rule used. In this paper, we assume the chair to have partial information about the votes and ask if the chair can add (delete) some votes so that his preferred (despised) candidate is (not) a winner for at least one completion of the partial votes to complete votes.
  • Citation
  • BibTeX
Erdélyi, G. & Reger, C., (2017). Possible Voter Control in k-Approval and k-Veto Under Partial Information. In: Mitschang, B., Nicklas, D., Leymann, F., Schöning, H., Herschel, M., Teubner, J., Härder, T., Kopp, O. & Wieland, M. (Hrsg.), Datenbanksysteme für Business, Technologie und Web (BTW 2017) - Workshopband. Bonn: Gesellschaft für Informatik e.V.. (S. 185-192).
@inproceedings{mci/Erdélyi2017,
author = {Erdélyi, Gábor AND Reger, Christian},
title = {Possible Voter Control in k-Approval and k-Veto Under Partial Information},
booktitle = {Datenbanksysteme für Business, Technologie und Web (BTW 2017) - Workshopband},
year = {2017},
editor = {Mitschang, Bernhard AND Nicklas, Daniela AND Leymann, Frank AND Schöning, Harald AND Herschel, Melanie AND Teubner, Jens AND Härder, Theo AND Kopp, Oliver AND Wieland, Matthias} ,
pages = { 185-192 },
publisher = {Gesellschaft für Informatik e.V.},
address = {Bonn}
}
DateienGroesseFormatAnzeige
paper24.pdf286.7Kb PDF View/Open

Haben Sie fehlerhafte Angaben entdeckt? Sagen Sie uns Bescheid: Send Feedback

More Info

ISBN: 978-3-88579-660-2
ISSN: 1617-5468
xmlui.MetaDataDisplay.field.date: 2017
Language: en (en)
Content Type: Text/Conference Paper

Keywords

  • computational social choice
  • voting
  • control
  • algorithms
  • complexity
  • partial information
Collections
  • P266 - BTW2017 - Datenbanksysteme für Business, Technologie und Web - Workshopband [47]

Show full item record


About uns | FAQ | Help | Imprint | Datenschutz

Gesellschaft für Informatik e.V. (GI), Kontakt: Geschäftsstelle der GI
Diese Digital Library basiert auf DSpace.

 

 


About uns | FAQ | Help | Imprint | Datenschutz

Gesellschaft für Informatik e.V. (GI), Kontakt: Geschäftsstelle der GI
Diese Digital Library basiert auf DSpace.