License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.07431.2
URN: urn:nbn:de:0030-drops-12749
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2007/1274/
Go to the corresponding Portal

Endriss, Ulle ; Lang, Jérôme ; Rossi, Francesca ; Sandholm, Tuomas

07431 Executive Summary -- Computational Issues in Social Choice

pdf-format:
07431_executive_summary.1274.pdf (0.09 MB)

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.

BibTeX - Entry

@InProceedings{endriss_et_al:DagSemProc.07431.2,
  author =	{Endriss, Ulle and Lang, J\'{e}r\^{o}me and Rossi, Francesca and Sandholm, Tuomas},
  title =	{{07431 Executive Summary – Computational Issues in Social Choice}},
  booktitle =	{Computational Issues in Social Choice},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7431},
  editor =	{Ulle Endriss and J\'{e}r\^{o}me Lang and Francesca Rossi and Tuomas Sandholm},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2007/1274},
  URN =		{urn:nbn:de:0030-drops-12749},
  doi =		{10.4230/DagSemProc.07431.2},
  annote =	{Keywords: Computational social choice, voting theory, fair division, mechanism design, coalition formation, complexity theory, preference representation, algorithms}
}

Keywords: Computational social choice, voting theory, fair division, mechanism design, coalition formation, complexity theory, preference representation,
Freie Schlagwörter (deutsch): algorithms
Collection: 07431 - Computational Issues in Social Choice
Issue Date: 2007
Date of publication: 14.12.2007

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI