PP-2006-55: A Short Introduction to Computational Social Choice

PP-2006-55: Chevaleyre, Yann and Endriss, Ulle and Lang, Jérôme and Maudet, Nicolas (2006) A Short Introduction to Computational Social Choice. [Report]

[img]
Preview
Text (Full Text)
PP-2006-55.text.pdf

Download (202kB) | Preview
[img] Text (Abstract)
PP-2006-55.abstract.txt

Download (1kB)

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.

Item Type: Report
Report Nr: PP-2006-55
Series Name: Prepublication (PP) Series
Year: 2006
Uncontrolled Keywords: computational social choice, complexity theory, social software, voting theory, fair division
Subjects: Computation
Depositing User: Ulle Endriss
Date Deposited: 12 Oct 2016 14:36
Last Modified: 12 Oct 2016 14:36
URI: https://eprints.illc.uva.nl/id/eprint/230

Actions (login required)

View Item View Item