Communication Dans Un Congrès Année : 2025

Characterizing Strategyproofness Through Score Functions in Voting Mechanisms

Résumé

This work focuses on the strategyproofness of voting systems in which voters select multiple options from a set of possibilities. These systems include those that are used for Participatory Budgeting, where elections are held to determine the allocation of a community budget (e.g., city or regional level) for funding various projects.We present a model for analyzing voting mechanisms and the Constrained Change Property (CCP), which serves as a criterion for designing strategyproof voting mechanisms. Additionally, we define a new concept of a social choice function and leverage it to develop a new class of utilitarian voting mechanisms, referred to as score voting. We prove that the mechanisms designed with core voting with a neutral score function are equivalent to knapsack voting on the same instance. Furthermore, we demonstrate that a score voting mechanism based on a total score function is strategyproof if and only if its score function satisfies CCP.Building on these findings, we propose an algorithm capable of identifying the closest total score function that ensures the strategyproofness of any given score voting mechanism.

Fichier principal
Vignette du fichier
2025-ijtcs-faw-with-proofs.pdf (536.5 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05040764 , version 1 (19-04-2025)

Licence

Identifiants

Citer

Felipe Furquim, Valentin Dardilhac, Daniel Cordeiro, Johanne Cohen. Characterizing Strategyproofness Through Score Functions in Voting Mechanisms. Frontiers of Algorithmics (IJTCS-FAW 2025), Jun 2025, Paris, France. pp.279-292, ⟨10.1007/978-981-96-8312-3_21⟩. ⟨hal-05040764⟩
1595 Consultations
259 Téléchargements

Altmetric

Partager

  • More