Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2104.09130
Cited By
Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules
19 April 2021
Piotr Faliszewski
P. Skowron
Nimrod Talmon
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules"
11 / 11 papers shown
Title
Computational Social Choice: Parameterized Complexity and Challenges
Jiehua Chena
Christian Hatschka
Sofia Simola
56
1
0
17 Oct 2024
Evaluation of Project Performance in Participatory Budgeting
Niclas Boehmer
Piotr Faliszewski
Łukasz Janeczko
Dominik Peters
Grzegorz Pierczynski
Šimon Schierreich
P. Skowron
Stanisław Szufa
94
5
0
22 Dec 2023
Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability
Yongjie Yang
Jian-xin Wang
65
9
0
09 Jul 2021
Proportionality and Strategyproofness in Multiwinner Elections
Dominik Peters
56
55
0
17 Apr 2021
Opinion Diffusion and Campaigning on Society Graphs
Piotr Faliszewski
Rica Gonen
Martin Koutecký
Nimrod Talmon
60
55
0
01 Oct 2020
Multi-Party Campaigning
Martin Koutecký
Nimrod Talmon
30
1
0
09 May 2020
On the Complexity of Destructive Bribery in Approval-Based Multi-winner Voting
Yongjie Yang
119
13
0
03 Feb 2020
Safe Voting: Resilience to Abstention and Sybils
R. Meir
Gal Shahaf
Ehud Shapiro
Nimrod Talmon
45
9
0
15 Jan 2020
On Coalitional Manipulation for Multiwinner Elections: Shortlisting
Robert Bredereck
Andrzej Kaczmarczyk
R. Niedermeier
39
15
0
27 Jun 2018
Computational Social Choice and Computational Complexity: BFFs?
L. Hemaspaandra
49
12
0
30 Oct 2017
Complexity of Shift Bribery in Committee Elections
Robert Bredereck
Piotr Faliszewski
R. Niedermeier
Nimrod Talmon
83
45
0
07 Jan 2016
1