DagSemProc.07431.2.pdf
- Filesize: 94 kB
- 3 pages
Document
07431 Executive Summary – Computational Issues in Social Choice
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 7431
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2007-12-14
Cite AsGet BibTex
Ulle Endriss, Jérôme Lang, Francesca Rossi, and Tuomas Sandholm. 07431 Executive Summary – Computational Issues in Social Choice. In Computational Issues in Social Choice. Dagstuhl Seminar Proceedings, Volume 7431, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
https://doi.org/10.4230/DagSemProc.07431.2
https://doi.org/10.4230/DagSemProc.07431.2
Abstract
Computational social choice is an interdisciplinary field of study at the interface
of social choice theory and computer science, with knowledge flowing in either direction.
On the one hand, computational social choice is concerned with importing concepts and procedures from
social choice theory for solving questions that arise in computer science and AI application domains.
This is typically the case for managing societies of autonomous agents, which calls for negotiation
and voting procedures. On the other hand, computational social choice is concerned with importing
notions and methods from computer science for solving questions originally stemming from social choice,
for instance by providing new perspectives on the problem of manipulation and control in elections.
This Dagstuhl Seminar has been devoted to the presentation of recent results and an exchange
of ideas in this growing research field.
Keywords
- Computational social choice
- voting theory
- fair division
- mechanism design
- coalition formation
- complexity theory
- preference representation
- algorithms
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads