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 …

Usually a voting rule requires agents to give their preferences as linear orders. However, in
some cases it is impractical for an agent to give a linear order over all the alternatives. It has …

AI Magazine Page 1 It was a late evening in Bitotia. The next day was going to be a big day:
Citizens of Bitotia would once and for all establish which byte order was better, big-endian (B) …

1 Her work has been supported in part by an NRW grant for gender-sensitive universities
supporting her as a junior professor for Computational Social Choice and by the project …

The margin of victory of an election, defined as the smallest number k such that k voters can
change the winner by voting differently, is an important measurement for robustness of the …

Abstract In 1992, Bartholdi, Tovey, and Trick opened the study of control attacks on elections-
--attempts to improve the election outcome by such actions as adding/deleting candidates or …

To make a joint decision, agents (or voters) are often required to provide their preferences
as linear orders. To determine a winner, the given linear orders can be aggregated …

We consider manipulation problems when the manipulator only has partial information
about the votes of the non-manipulators. Such partial information is described by an {\em …

In multiagent systems, social choice functions can help aggregate the distinct preferences
that agents have over alternatives, enabling them to settle on a single choice. Despite the …

We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate
the Borda voting rule. This resolves one of the last open problems in the computational …