[PDF][PDF] Reasoning about inconsistent formulas

J Marques-Silva, C Mencía - Proceedings of the Twenty-Ninth …, 2020 - digibuo.uniovi.es
The analysis of inconsistent formulas finds an everincreasing range of applications, that
include axiom pinpointing in description logics, fault localization in software, model-based …

Computational social choice: The first ten years and beyond

H Aziz, F Brandt, E Elkind, P Skowron - … and Software Science: State of the …, 2019 - Springer
Computational social choice is a research area at the intersection of computer science,
mathematics, and economics that is concerned with aggregation of preferences of multiple …

Analysing irresolute multiwinner voting rules with approval ballots via SAT solving

B Kluiving, A de Vries, P Vrijbergen, A Boixel… - ECAI 2020, 2020 - ebooks.iospress.nl
Suppose you want to design a voting rule that can be used to elect a committee or
parliament by asking each voter to approve of a subset of the candidates standing. There …

Declarative Approaches to Outcome Determination in Judgment Aggregation

A Conati, A Niskanen, M Järvisalo - Journal of Artificial Intelligence …, 2024 - jair.org
Judgment aggregation (JA) offers a generic formal framework for modeling various set-tings
involving information aggregation by social choice mechanisms. For many judgment …

[PDF][PDF] Strategic Abstention Based on Preference Extensions: Positive Results and Computer-Generated Impossibilities.

F Brandl, F Brandt, C Geist, J Hofbauer - IJCAI, 2015 - pub.dss.in.tum.de
Voting rules allow multiple agents to aggregate their preferences in order to reach joint
decisions. A common flaw of some voting rules, known as the no-show paradox, is that …

Sat-based automated mechanism design for false-name-proof facility location

N Okada, T Todo, M Yokoo - PRIMA 2019: Principles and Practice of Multi …, 2019 - Springer
In the literature of mechanism design, market mechanisms have been developed by
professionals based on their experience. The concept of automated mechanism design …

Voting theory in the Lean theorem prover

WH Holliday, C Norman, E Pacuit - International Workshop on Logic …, 2021 - Springer
There is a long tradition of fruitful interaction between logic and social choice theory. In
recent years, much of this interaction has focused on computer-aided methods such as SAT …

Autonomous vehicles coordination through voting-based decision-making

M Teixeira, PM d'Orey, Z Kokkinogenis - International conference on …, 2018 - Springer
This paper proposes the application of computational social choice mechanisms to establish
cooperative behavior within traffic scenarios involving autonomous vehicles. The main aim …

Characterizations of voting rules based on majority margins

Y Ding, WH Holliday, E Pacuit - arXiv preprint arXiv:2501.08595, 2025 - arxiv.org
In the context of voting with ranked ballots, an important class of voting rules is the class of
margin-based rules (also called pairwise rules). A voting rule is margin-based if whenever …

Strategic abstention based on preference extensions: Positive results and computer-generated impossibilities

F Brandl, F Brandt, C Geist, J Hofbauer - Journal of Artificial Intelligence …, 2019 - jair.org
Voting rules allow multiple agents to aggregate their preferences in order to reach joint
decisions. A common flaw of some voting rules, known as the no-show paradox, is that …