TY - CHAP
T1 - Computational social choice
T2 - The first ten years and beyond
AU - Aziz, Haris
AU - Brandt, Felix
AU - Elkind, Edith
AU - Skowron, Piotr
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2019.
PY - 2019
Y1 - 2019
N2 - 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 agents. Typical applications include voting, resource allocation, and fair division. This chapter highlights six representative research areas in contemporary computational social choice: restricted preference domains, voting equilibria and iterative voting, multiwinner voting, probabilistic social choice, random assignment, and computer-aided theorem proving.
AB - 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 agents. Typical applications include voting, resource allocation, and fair division. This chapter highlights six representative research areas in contemporary computational social choice: restricted preference domains, voting equilibria and iterative voting, multiwinner voting, probabilistic social choice, random assignment, and computer-aided theorem proving.
UR - http://www.scopus.com/inward/record.url?scp=85085530610&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-91908-9_4
DO - 10.1007/978-3-319-91908-9_4
M3 - Chapter
AN - SCOPUS:85085530610
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 48
EP - 65
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PB - Springer
ER -