Hardness and algorithms for electoral manipulation under media influence

DOI10.1007/978-3-030-97099-4_4zbMath1530.91170OpenAlexW4214852070MaRDI QIDQ6113911

Shouhuai Xu, Lei Xu, Dian Huang, Zhi Min Gao, Liangde Tao, Weidong (Larry) Shi, Lin Chen

Publication date: 10 August 2023

Published in: Frontiers of Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-97099-4_4

zbMATH Keywords

computational complexitydynamic programmingcomputational social choice

Mathematics Subject Classification ID

Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social choice (91B14)

Cites Work

• Prices matter for the parameterized complexity of shift bribery
• Exact algorithms and applications for tree-like Weighted Set Cover
• Approximability and parameterized complexity of multicover by \(c\)-intervals
• On the set multicover problem in geometric settings
• Multimode Control Attacks on Elections
• Swap Bribery
• How Hard Is Bribery in Elections?
• Exact Algorithms for Set Multicover and Multiset Multicover Problems
• Opinion diffusion and campaigning on society graphs
• Handbook of Computational Social Choice
• The Parameterized Complexity of k-B<scp>iclique</scp>
• Complexity of Shift Bribery in Committee Elections

This page was built for publication: Hardness and algorithms for electoral manipulation under media influence