Edited by Jac C. Heckelman and Nicholas R. Miller
Chapter 5: Computational social choice
Computational social choice refers to a set of research areas found at the intersection of social choice theory and computer science. These research areas can be divided into three main categories, two of which will be discussed in detail in this chapter. The first is the use of computational tools to analyze, apply or extend traditional social choice models. One example is the use of ‘simulation experiments’ to explore the robustness of an existing social choice finding. Another example is the use of agent-based models to explore, test and experiment with complex social choice systems consisting of heterogeneous agents and multiple layers of social choice rules. The second major area of research in computational social choice is the application of computer science concepts to traditional issues within social choice. For instance, computer science concepts can be used to categorize voting rules based on their computational complexity or to examine communication complexity by measuring the amount of information that would need to be exchanged in a given social choice setting. Further, the computer science concept of knowledge representation is a useful tool for compactly representing preferences in highly combinatorial social choice scenarios.
You are not authenticated to view the full text of this chapter or article.
Elgaronline requires a subscription or purchase to access the full text of books or journals. Please login through your library system or with your personal username and password on the homepage.
Non-subscribers can freely search the site, view abstracts/ extracts and download selected front matter and introductory chapters for personal use.
Your library may not have purchased all subject areas. If you are authenticated and think you should have access to this title, please contact your librarian.