Strategic Manipulation in Temporal Voting with Undesirable Candidates (Student Abstract)

Abstract

We study a model of sequential decision-making where voters have dynamic preferences over a set of candidates that are undesirable. This models scenarios such as the implementation of projects that are overall beneficial to society, but impose individual costs on certain affected individuals. We show that while minimizing the sum of agents' disutilities can be done in polynomial time, minimizing the maximum disutility obtained by any agent is computationally intractable, even in restricted cases. We then examine the potential for agents to engage in strategic manipulation in response to these welfare objectives, offering insights into possible misconduct within such decision-making environments.

Cite

Text

Neoh and Teh. "Strategic Manipulation in Temporal Voting with Undesirable Candidates (Student Abstract)." AAAI Conference on Artificial Intelligence, 2025. doi:10.1609/AAAI.V39I28.35282

Markdown

[Neoh and Teh. "Strategic Manipulation in Temporal Voting with Undesirable Candidates (Student Abstract)." AAAI Conference on Artificial Intelligence, 2025.](https://mlanthology.org/aaai/2025/neoh2025aaai-strategic/) doi:10.1609/AAAI.V39I28.35282

BibTeX

@inproceedings{neoh2025aaai-strategic,
  title     = {{Strategic Manipulation in Temporal Voting with Undesirable Candidates (Student Abstract)}},
  author    = {Neoh, Tzeh Yuan and Teh, Nicholas},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2025},
  pages     = {29445-29447},
  doi       = {10.1609/AAAI.V39I28.35282},
  url       = {https://mlanthology.org/aaai/2025/neoh2025aaai-strategic/}
}