Back to Results
First PageMeta Content
Analysis of algorithms / Social choice theory / Single winner electoral systems / Parameterized complexity / Borda count / Voting system / Time complexity / FO / Reduction / Theoretical computer science / Computational complexity theory / Applied mathematics


Prices Matter for the Parameterized Complexity of Shift Bribery Robert Bredereck1 , Jiehua Chen1 , Piotr Faliszewski2 , Andr´e Nichterlein1 , and Rolf Niedermeier1 1 TU Berlin, Berlin, Germany {robert.bredereck, jiehua.
Add to Reading List

Document Date: 2014-05-07 05:57:23

Open Document

File Size: 218,47 KB

Share Result on Facebook

City

Berlin / Maximin / Borda / Krakow / /

Company

Oxford University Press / Wikimedia Foundation / ACM Press / AAAI Press / /

Country

Poland / Germany / /

/

Facility

AGH University of Science / /

IndustryTerm

found approximation algorithms / polynomial-time approximation algorithms / multiagent systems / approximation algorithm / brute-force search / web search engines / dynamic-programming algorithm / Web Conference / 2approximation algorithm / correct solution / Approximation algorithms / campaign management / /

OperatingSystem

XP / /

Organization

AGH University of Science and Technology / Artificial Copyright Intelligence / Board of Trustees / Association for the Advancement / Oxford University / X.Org Foundation / /

Person

Piotr Faliszewski / S HIFT / Elkind / Robert Bredereck / /

PoliticalEvent

presidential elections / /

Position

designated candidate / campaign manager / /

ProvinceOrState

Copeland / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

FPT algorithm / WAP / polynomial-time approximation algorithms / found approximation algorithms / FPT algorithms / artificial intelligence / approximation algorithm / expensive dynamic-programming algorithm / 2-approximation algorithm / 2approximation algorithm / Approximation algorithms / XP algorithm / /

URL

www.aaai.org / /

SocialTag