Goal-Based Collective Decisions: Axiomatics and Computational Complexity - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Goal-Based Collective Decisions: Axiomatics and Computational Complexity

Résumé

We study agents expressing propositional goals over a set of binary issues to reach a collective decision. We adapt properties and rules from the literature on Social Choice Theory to our setting, providing an axiomatic characterisation of a majority rule for goal-based voting. We study the computational complexity of finding the outcome of our rules (i.e., winner determination), showing that it ranges from Nondeterministic Polynomial Time (NP) to Probabilistic Polynomial Time (PP).
Fichier principal
Vignette du fichier
COMSOC18.pdf (284.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03023413 , version 1 (02-12-2020)

Identifiants

  • HAL Id : hal-03023413 , version 1

Citer

Arianna Novaro, Umberto Grandi, Dominique Longin, Emiliano Lorini. Goal-Based Collective Decisions: Axiomatics and Computational Complexity. 7th International Workshop on Computational Social Choice (COMSOC 2018), Jun 2018, Troy, NY, United States. ⟨hal-03023413⟩
40 Consultations
15 Téléchargements

Partager

Gmail Facebook X LinkedIn More