• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Towards automatic argumentation about voting rules

Thumbnail
Date
2018
Link to item file
https://hal.archives-ouvertes.fr/hal-01830911
Dewey
Recherche opérationnelle
Sujet
Social choice theory; bounded model checking; argumentation theory; automated reasoning
Conference name
4ème conférence sur les Applications Pratiques de l'Intelligence Artificielle (APIA 2018)
Conference date
07-2018
Conference city
Nancy
Conference country
France
URI
https://basepub.dauphine.fr/handle/123456789/21187
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Kirsten, Michael
Cailloux, Olivier
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Type
Communication / Conférence
Abstract (EN)
Voting rules aggregate the preferences of a group to make decisions. As multiple reasonable voting rules exist, the ax-iomatic approach has been proposed to exhibit both their merits and paradoxical behaviors. It consists in characterizing a voting rule by a set of understandable properties called axioms. It is however a difficult task to characterize a voting rule by such axioms, and even when a proof exists, it may be difficult to understand why a specific voting rule fails to satisfy a given axiom, especially for untrained users. In this article, we present an automatic method which determines whether a given rule satisfies a set of axioms. When the rule does not satisfy an axiom, the automatic prover generates comprehensible evidence of the violation in the form of a counterexample. It can be used by non-expert users to comprehend the violation and may serve to argue in favor of other rules which satisfy the axiom. Our method is based on the software analysis technique bounded model checking, which enables bounded verification for properties of software programs. It translates the program together with user-annotations into a reachability problem for those profiles and outcomes which adhere to our specification. The method can be applied to arbitrary voting rules; we demonstrate it on the case of the Borda axiomatization and compare the Borda rule to both the Black and the Copeland voting rules.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.