Abstract
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.
Cite
CITATION STYLE
Aziz, H., Brandt, F., Elkind, E., & Skowron, P. (2019). Computational social choice: The first ten years and beyond. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10000, pp. 48–65). Springer. https://doi.org/10.1007/978-3-319-91908-9_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
