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.
| Original language | English (US) |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Publisher | Springer |
| Pages | 48-65 |
| Number of pages | 18 |
| DOIs | |
| State | Published - 2019 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 10000 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Funding
Haris Aziz is supported by a Julius Career Award. Felix Brandt is supported by the DFG under grant BR 2312/11-1. Edith Elkind and Piotr Skowron are supported by the ERC under grant 639945 (ACCORD). Piotr Skowron is also supported by a Humboldt Research Fellowship for Postdoctoral Researchers. The authors thank Florian Brandl and Dominik Peters for helpful feedback.
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science