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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call