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 …

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 …

One of the most important desirable properties in social choice theory is Condorcet-
consistency, which requires that a voting rule should return an alternative that is preferred to …

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 …

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 …

We study social decision schemes (SDSs), ie, functions that map a collection of individual
preferences over alternatives to a lottery over the alternatives. Depending on how …

Facility location is a well-studied problem in social choice literature, where agents'
preferences are restricted to be singlepeaked. When the number of agents is treated as a …

Results from voting theory are increasingly used when dealing with collective decision
making in computational multiagent systems. An important and surprising phenomenon in …