Abstract
AbstractGiven 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.
Funder
Deutsche Forschungsgemeinschaft
OP VVV MEYS
Technische Universität Clausthal
Publisher
Springer Science and Business Media LLC
Reference39 articles.
1. Baumeister, D., Erdélyi, G., & Rothe, J. (2011). How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation. In Proceedings of the 2nd iternational conference on algorithmic decision theory (ADT ’11) (pp. 1–15).
2. Boehmer, N., Bredereck, R., Knop, D., & Luo, J. (2020). Fine-grained view on bribery for group identification. In Proceedings of the 29th international joint conference on artificial intelligence (IJCAI ’20) (pp. 67–73).
3. Boehmer, N., Bredereck, R., Faliszewski, P., & Niedermeier, R. (2021a). Winner robustness via swap- and shift-bribery: Parameterized counting complexity and experiments. In Proceedings of the 30th Iiternational joint conference on artificial intelligence (IJCAI ’21) (pp. 52–58).
4. Boehmer, N., Bredereck, R., Heeger, K., & Niedermeier, R. (2021). Bribery and control in stable marriage. Journal of Artificial Intelligence Research, 71, 993–1048.
5. Boehmer, N., Bredereck, R., Knop, D., & Luo, J. (2021c). Finding small multi-demand set covers with ubiquitous elements and large sets is fixed-parameter tractable. CoRR arXiv:2104.0124