Alouf-Heffetz, ShiriShiriAlouf-HeffetzInamdar, TanmayTanmayInamdarJain, PallaviPallaviJainTalmon, NimrodNimrodTalmonHiren, Yash MoreYash MoreHiren2025-08-312025-08-312024-01-012-s2.0-85196384941https://d8.irins.org/handle/IITG2025/29219In liquid democracy, agents can either vote directly or delegate their vote to a different agent of their choice. This results in a power structure in which certain agents possess more voting weight than others. As a result, it opens up certain possibilities of vote manipulation, including control and bribery, that do not exist in standard voting scenarios of direct democracy. Here we formalize a certain kind of election control - in which an external agent may change certain delegation arcs - and study the computational complexity of the corresponding combinatorial problem.falsecomputational complexity | Computational social choice | liquid democracy | manipulation | parameterized complexity | proxy votingConference Paper155829142624-263220242cpConference Proceeding