Abductive and Contrastive Explanations for Scoring Rules in Voting
Open Access
- 16 October 2024
- book chapter
- Published by IOS Press
- p. 3565-3572
Abstract
We view voting rules as classifiers that assign a winner (a class) to a profile of voters’ preferences (an instance). We propose to apply techniques from formal explainability, most notably abductive and contrastive explanations, to identify minimal subsets of a preference profile that either imply the current winner or explain why a different candidate was not elected. Formal explanations turn out to have strong connections with classical problems studied in computational social choice such as bribery, possible and necessary winner identification, and preference learning. We design algorithms for computing abductive and contrastive explanations for scoring rules. For the Borda rule, we find a lower bound on the size of the smallest abductive explanations, and we conduct simulations to identify correlations between properties of preference profiles and the size of their smallest abductive explanations.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Large language models (LLMs) as agents for augmented democracyPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2024
- Abductive and Contrastive Explanations for Scoring Rules in Voting2024
- Understanding political divisiveness using online participation data from the 2022 French and Brazilian presidential electionsNature Human Behaviour, 2023
- A unified logical framework for explanations in classifier systemsJournal of Logic and Computation, 2023
- Special issue on Explainable Artificial Intelligence (XAI)Artificial Intelligence, 2022
- Determining Possible and Necessary Winners Given Partial OrdersJournal of Artificial Intelligence Research, 2011
- Chapter 4 Voting procedures2002