<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-22T17:54:05Z</responseDate>
  <request identifier="3532" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:3532</identifier>
        <datestamp>2024-03-06T10:25:49Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Computation and Incentives in Social Choice (Dagstuhl Seminar 12101)</dc:title>
          <dc:creator>Elkind, Edith</dc:creator>
          <dc:creator>Klamler, Christian</dc:creator>
          <dc:creator>Rosenschein, Jeffrey S.</dc:creator>
          <dc:creator>Sanver, M. Remzi</dc:creator>
          <dc:subject>Computational Social Choice</dc:subject>
          <dc:subject>Voting</dc:subject>
          <dc:subject>Incentives</dc:subject>
          <dc:subject>Algorithmic Game Theory</dc:subject>
          <dc:description>Computational social choice is an active research area that combines tools&#13;
and techniques of theoretical computer science and AI with those of mathematics,&#13;
social sciences and economics. The aim of the Dagstuhl Seminar 12101 ``Computation and Incentives in Social Choice'' was to bring together the experts in these areas in order to discuss recent advances in this field and share open problems. This report collects the material presented during the course of the&#13;
seminar.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Edith Elkind and Christian Klamler and Jeffrey S. Rosenschein and M. Remzi Sanver</dc:contributor>
          <dc:date>2012</dc:date>
          <dc:relation>Is Part Of Dagstuhl Reports, Volume 2, Issue 3 (2012)</dc:relation>
          <dc:type>Article</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagRep.2.3.1</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-35322</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.3.1</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
