Prices matter for the parameterized complexity of shift bribery

In the Shift Bribery problem, we are given an election, a preferred candidate p, and a budget. The goal is to ensure p's victory by shifting p higher in some voters' preference orders. However, each such shift request comes at a price and we must not exceed the given budget. We study the p...

Celý popis

Podrobná bibliografia

Vydané v:	Information and computation Ročník 251; s. 140 - 164
Hlavní autori:	Bredereck, Robert, Chen, Jiehua, Faliszewski, Piotr, Nichterlein, André, Niedermeier, Rolf
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.12.2016
Predmet:	Computational social choice Fixed-parameter tractability (FPT) FPT approximation scheme Multivariate complexity analysis Voting and rank aggregation W-hardness W-hardness Computational social choice Fixed-parameter tractability (FPT) FPT approximation scheme Voting and rank aggregation Multivariate complexity analysis
ISSN:	0890-5401, 1090-2651
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!