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).
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...