2026-07-21T14:13:07Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1274 2024-03-06T11:07:45Z ddc:004 open_access

07431 Executive Summary – Computational Issues in Social Choice Endriss, Ulle Lang, Jérôme Rossi, Francesca Sandholm, Tuomas Computational social choice voting theory fair division mechanism design coalition formation complexity theory preference representation algorithms 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Ulle Endriss and Jérôme Lang and Francesca Rossi and Tuomas Sandholm 2007 Is Part Of Dagstuhl Seminar Proceedings, Volume 7431, Computational Issues in Social Choice (2007) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.07431.2 urn:nbn:de:0030-drops-12749 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07431.2 eng https://creativecommons.org/licenses/by/4.0/legalcode