Not in My Backyard! Temporal Voting Over Public Chores

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Elkind, Edith, Neoh, Tzeh Yuan, Teh, Nicholas
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913985929936896
author Elkind, Edith
Neoh, Tzeh Yuan
Teh, Nicholas
author_facet Elkind, Edith
Neoh, Tzeh Yuan
Teh, Nicholas
contents We study a temporal voting model where voters have dynamic preferences over a set of public chores -- projects that benefit society, but impose individual costs on those affected by their implementation. We investigate the computational complexity of optimizing utilitarian and egalitarian welfare. Our results show that while optimizing the former is computationally straightforward, minimizing the latter is computationally intractable, even in very restricted cases. Nevertheless, we identify several settings where this problem can be solved efficiently, either exactly or by an approximation algorithm. We also examine the effects of enforcing temporal fairness and its impact on social welfare, and analyze the competitive ratio of online algorithms. We then explore the strategic behavior of agents, providing insights into potential malfeasance in such decision-making environments. Finally, we discuss a range of fairness measures and their suitability for our setting.
format Preprint
id arxiv_https___arxiv_org_abs_2508_08810
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Not in My Backyard! Temporal Voting Over Public Chores
Elkind, Edith
Neoh, Tzeh Yuan
Teh, Nicholas
Computer Science and Game Theory
Artificial Intelligence
Multiagent Systems
Theoretical Economics
We study a temporal voting model where voters have dynamic preferences over a set of public chores -- projects that benefit society, but impose individual costs on those affected by their implementation. We investigate the computational complexity of optimizing utilitarian and egalitarian welfare. Our results show that while optimizing the former is computationally straightforward, minimizing the latter is computationally intractable, even in very restricted cases. Nevertheless, we identify several settings where this problem can be solved efficiently, either exactly or by an approximation algorithm. We also examine the effects of enforcing temporal fairness and its impact on social welfare, and analyze the competitive ratio of online algorithms. We then explore the strategic behavior of agents, providing insights into potential malfeasance in such decision-making environments. Finally, we discuss a range of fairness measures and their suitability for our setting.
title Not in My Backyard! Temporal Voting Over Public Chores
topic Computer Science and Game Theory
Artificial Intelligence
Multiagent Systems
Theoretical Economics
url https://arxiv.org/abs/2508.08810