A Calculus for Computing Structured Justifications for Election Outcomes
Arthur Boixel, Ulle Endriss, Ronald de Haan
2022Year
17Citations
2Top-tier citations
Abstract
In the context of social choice theory, we develop a tableaubased calculus for reasoning about voting rules. This calculus can be used to obtain structured explanations for why a given set of axioms justifies a given election outcome for a given profile of voter preferences. We then show how to operationalise this calculus, using a combination of SAT solving and Answer Set Programming, to arrive at a flexible framework for presenting human-readable justifications to users.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers2
- Explainable and Efficient Randomized Voting RulesSoroush Ebadian, Aris Filos-Ratsikas, Mohamad Latifian, Nisarg ShahNeurIPS 2023 · 10 citations
- Explaining Tournament Solutions with Minimal SupportsClément Contet, Umberto Grandi, Jérôme MenginAAAI 2026
Builds on2
Related papers
- Using MaxSAT for Efficient Explanations of Tree EnsemblesAlexey Ignatiev, Yacine Izza, Peter J. Stuckey, João Marques-SilvaAAAI 2022 · 75 citations
- Computing the Why-Provenance for Datalog Queries via SAT SolversMarco Calautti, Ester Livshits, Andreas Pieris, Markus SchneiderAAAI 2024 · 4 citations
- Proportionality in Approval-Based Participatory BudgetingMarkus Brill, Stefan Forster, Martin Lackner, Jan Maly et al.AAAI 2023 · 34 citations
- On the Edge of Core (Non-)Emptiness: An Automated Reasoning Approach to Approval-Based Multi-Winner VotingRatip Emin Berker, Emanuel Tewolde, Vincent Conitzer, Mingyu Guo et al.AAAI 2026 · 4 citations
- The Complexity of Learning Approval-Based Multiwinner Voting RulesIoannis Caragiannis, Karl FehrsAAAI 2022 · 6 citations
