A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F14%3A00221007" target="_blank" >RIV/68407700:21240/14:00221007 - isvavai.cz</a>
Result on the web
<a href="http://jair.org/papers/paper4285.html" target="_blank" >http://jair.org/papers/paper4285.html</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1613/jair.4285" target="_blank" >10.1613/jair.4285</a>
Alternative languages
Result language
angličtina
Original language name
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
Original language description
Assume that each of n voters may or may not approve each of m issues. If an actor (the lobby) may influence up to k voters, then the central question of the NP-hard Lobbying problem is whether the lobby can choose the voters to be influenced so that as aresult each issue gets a majority of approvals. This problem can be modeled as a simple matrix modification problem: Can one set k rows of a binary n x m-matrix to all-1 rows such that each column in the resulting matrix has a majority of 1s? Significantly extending on previous work that showed parameterized intractability (W[2]-completeness) with respect to the number k of modified rows, we study how the natural parameters such n, m, k, or the "maximum number of 1s missing for any column to have a majority of 1s" (referred to as "gap value g") govern the computational complexity of Lobbying. Among other results, we prove that Lobbying is fixed-parameter tractable for parameter m and provide a greedy logarithmic-factor approximation al
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Artificial Intelligence Research
ISSN
1076-9757
e-ISSN
—
Volume of the periodical
50
Issue of the periodical within the volume
—
Country of publishing house
US - UNITED STATES
Number of pages
38
Pages from-to
409-446
UT code for WoS article
000339312000001
EID of the result in the Scopus database
—