When aggregating the preferences of multiple agents into one collective choice, it is easily
seen that certain cases call for randomization or other means of tiebreaking. For example, if …

After an introductory section, this article will focus on four questions: How should the Kyoto
School be defined? What is meant by its central philosophical concept of “absolute …

The Four Color Theorem is a famous early example of a mathematical result that was proven
with the help of computers. Recent advances in artificial intelligence, particularly in …

We introduce the domain of preferences that are single-peaked on a circle, which is a
generalization of the well-studied single-peaked domain. This preference restriction is …

Multiwinner voting rules can be used to select a fixed-size committee from a larger set of
candidates. We consider approval-based committee rules, which allow voters to approve or …

Voting paradoxes date back to the origin of social choice theory in the 18th century, when
the Chevalier de Borda pointed out that plurality—then and now the most common voting …

We study two notions of stability in multiwinner elections that are based on the Condorcet
criterion. The first notion was introduced by Gehrlein: A committee is stable if each …

Two important requirements when aggregating the preferences of multiple agents are that
the outcome should be economically efficient and the aggregation mechanism should not be …

A promising direction in computational social choice is to address research problems using
computer-aided proving techniques. In particular with SAT solvers, this approach has been …

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 …