A Short Introduction to Computational Social Choice
Yann Chevaleyre, Ulle Endriss, Jérôme Lang, Nicolas Maudet

Abstract:
Computational social choice is an interdisciplinary field of study at
the interface of social choice theory and computer science, promoting
an exchange of ideas in both directions. On the one hand, it is
concerned with the application of techniques developed in computer
science, such as complexity analysis or algorithm design, to the study
of social choice mechanisms, such as voting procedures or fair
division algorithms. On the other hand, computational social choice is
concerned with importing concepts from social choice theory into
computing. For instance, the study of preference aggregation
mechanisms is also very relevant to multiagent systems. In this short
paper we give a general introduction to computational social choice,
by proposing a taxonomy of the issues addressed by this discipline,
together with some illustrative examples and an (incomplete)
bibliography.