Social choice theory concerns the design and formal analysis of methods for aggregating
the preferences of multiple agents. Examples of such methods include voting procedures …

Tournaments are commonly used to select winning alternatives in scenarios involving
pairwise comparisons such as sports competitions and political elections. This survey …

3 Tournament Solutions Page 1 3 Tournament Solutions Felix Brandta, Markus Brillb, and
Paul Harrensteinc 3.1 Introduction Perhaps one of the most natural ways to aggregate binary …

We propose a Condorcet-consistent voting method that we call Split Cycle. Split Cycle
belongs to the small family of known voting methods satisfying the anti-vote-splitting criterion …

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 …

An alternative is said to be a Condorcet winner of an election if it is preferred to any other
alternative by a majority of voters. While this is a very attractive solution concept, many …

A fundamental property of choice functions is stability, which, loosely speaking, prescribes
that choice sets are invariant under adding and removing unchosen alternatives. We provide …

Tournament solutions are frequently used to select winners from a set of alternatives based
on pairwise comparisons between them. Prior work has shown that several common …

We study opinion formation games based on the Friedkin-Johnsen (FJ) model. We are
interested in simple and natural variants of the FJ model that use limited information …

Tournament solutions constitute an important class of social choice functions that only
depend on the pairwise majority comparisons between alternatives. Recent analytical …