Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ https://www.ijcai.or...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
https://www.ijcai.org/proceedi...
Article
Data sources: UnpayWall
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Autonomous Agents and Multi-Agent Systems
Article . 2021 . Peer-reviewed
License: CC BY
Data sources: Crossref
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Autonomous Agents and Multi-Agent Systems
Article
License: CC BY
Data sources: UnpayWall
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
arXiv.org e-Print Archive
Preprint . 2018
Data sources: arXiv.org e-Print Archive
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
edoc-Server. Open-Access-Publikationsserver der Humboldt-Universität zu Berlin
Article . 2021 . Peer-reviewed
Data sources: edoc-Server. Open-Access-Publikationsserver der Humboldt-Universität zu Berlin
https://doi.org/10.24963/ijcai...
Article . 2017 . Peer-reviewed
Data sources: Crossref
https://dx.doi.org/10.48550/ar...
Article . 2018
License: arXiv Non-Exclusive Distribution
Data sources: Datacite
https://dx.doi.org/10.14279/de...
Article . 2021
License: CC BY
Data sources: Datacite
DBLP
Article
Data sources: DBLP
DBLP
Conference object
Data sources: DBLP
DBLP
Article
Data sources: DBLP
https://dx.doi.org/10.24963/ij...
Article
Data sources: Microsoft Academic Graph
https://dx.doi.org/10.1007/s10...
Article
Data sources: Microsoft Academic Graph
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
DepositOnce
Article . 2023
License: CC BY
Data sources: DepositOnce
https://dx.doi.org/10.24963/ij...
Article
Data sources: Microsoft Academic Graph
https://dx.doi.org/10.1007/s10...
Article
Data sources: Microsoft Academic Graph
 View all 10 versions
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

On Coalitional Manipulation for Multiwinner Elections: Shortlisting

descriptionPublicationkeyboard_double_arrow_right Article , Preprint , Conference object 01 Aug 2017Embargo end date: 01 Jan 2018 Germany Publisher:International Joint Conferences on Artificial Intelligence OrganizationJournal:Proceedings of the Twenty-Sixth International Joint Conference on Artificial IntelligenceFunded by:DFG | unidentified
Authors: Robert Bredereck; Andrzej Kaczmarczyk 0001; Rolf Niedermeier;

doi: 10.24963/ijcai.2017/123 , 10.1007/s10458-021-09507-9 , 10.48550/arxiv.1806.10460 , 10.14279/depositonce-17307

arXiv: 1806.10460

On Coalitional Manipulation for Multiwinner Elections: Shortlisting

Abstract

Shortlisting of candidates—selecting a group of “best” candidates—is a special case of multiwinner elections. We provide the first in-depth study of the computational complexity of strategic voting for shortlisting based on the most natural and simple voting rule in this scenario, l-Bloc (every voter approves l candidates). In particular, we investigate the influence of several tie-breaking mechanisms (e.g. pessimistic versus optimistic) and group evaluation functions (e.g. egalitarian versus utilitarian) and conclude that in an egalitarian setting strategic voting may indeed be computationally intractable regardless of the tie-breaking rule. We provide a fairly comprehensive picture of the computational complexity landscape of this neglected scenario.

Country
Germany
Related Organizations
View all View all
Keywords

ddc:004, FOS: Computer and information sciences, Strategic voting, Computational Complexity (cs.CC), Tie-breaking, Computer Science - Computer Science and Game Theory, tie-breaking, Computer Science - Data Structures and Algorithms, Computer Science - Multiagent Systems, Data Structures and Algorithms (cs.DS), 000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung; Informatik, utility aggregation, SNTV, Parameterized computational complexity, strategic voting, bloc, Computational social choice, parameterized computational complexity, computational social choice, 004 Informatik, Utility aggregation, Computer Science - Computational Complexity, Bloc, Multiagent Systems (cs.MA), Computer Science and Game Theory (cs.GT)

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 5
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Average
    OpenAIRE UsageCounts
    Usage byUsageCounts
    visibility views 70
    download downloads 32
  • 70
    views
    32
    downloads
    Powered byOpenAIRE UsageCounts
Powered by OpenAIRE graph
Found an issue? Give us feedback
visibility
download
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
views
OpenAIRE UsageCountsViews provided by UsageCounts
downloads
OpenAIRE UsageCountsDownloads provided by UsageCounts
5
Top 10%
Average
Average
70
32
Green
hybrid
Related to Research communities
Knowmad Institut
UArctic