Fine-grained view on bribery for group identification
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F23%3A00366259" target="_blank" >RIV/68407700:21240/23:00366259 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s10458-023-09597-7" target="_blank" >https://doi.org/10.1007/s10458-023-09597-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10458-023-09597-7" target="_blank" >10.1007/s10458-023-09597-7</a>
Alternative languages
Result language
angličtina
Original language name
Fine-grained view on bribery for group identification
Original language description
Given a set of agents qualifying or disqualifying each other, group identification is the task of identifying a socially qualified subgroup of agents. Social qualification depends on the specific rule used to aggregate individual qualifications . The classical bribery problem in this context asks how many agents need to change their qualifications in order to change the outcome in a certain way. Complementing previous results showing polynomial-time solvability or NP-hardness of bribery for various social rules in the constructive (aiming at making specific agents socially qualified) or destructive (aiming at making specific agents socially disqualified) setting, we provide a comprehensive picture of the parameterized computational complexity landscape. Conceptually, we also consider a more fine-grained concept of bribery cost, where we ask how many single qualifications need to be changed, nonunit prices for different bribery actions, and a more general bribery goal that combines the constructive and destructive setting.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2023
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
Autonomous Agents and Multi-Agent Systems
ISSN
1387-2532
e-ISSN
1573-7454
Volume of the periodical
37
Issue of the periodical within the volume
1
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
32
Pages from-to
—
UT code for WoS article
000959469500001
EID of the result in the Scopus database
2-s2.0-85150993552