<?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-20T05:25:44Z</responseDate>
  <request identifier="1273" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1273</identifier>
        <datestamp>2024-03-06T11:07:45Z</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>07431 Abstracts Collection – Computational Issues in Social Choice</dc:title>
          <dc:creator>Endriss, Ulle</dc:creator>
          <dc:creator>Lang, Jérôme</dc:creator>
          <dc:creator>Rossi, Francesca</dc:creator>
          <dc:creator>Sandholm, Tuomas</dc:creator>
          <dc:subject>Computational social choice</dc:subject>
          <dc:subject>voting theory</dc:subject>
          <dc:subject>fair division</dc:subject>
          <dc:subject>mechanism design</dc:subject>
          <dc:subject>coalition formation</dc:subject>
          <dc:subject>complexity theory</dc:subject>
          <dc:subject>preference representation</dc:subject>
          <dc:subject>algorithms</dc:subject>
          <dc:description>From the 21st to the 26th of October 2007, the Dagstuhl Seminar 07431 &#13;
on ``Computational Issues in Social Choice'' was held&#13;
at the International Conference and Research Center (IBFI), Schloss Dagstuhl.&#13;
During the seminar, several participants presented their recent&#13;
research, and ongoing work and open problems were discussed. &#13;
The abstracts of the talks given during the seminar are collected in this paper.&#13;
The first section summarises the seminar topics and goals in general.&#13;
Links to full papers are provided where available.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Ulle Endriss and Jérôme Lang and Francesca Rossi and Tuomas Sandholm</dc:contributor>
          <dc:date>2007</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 7431, Computational Issues in Social Choice (2007)</dc:relation>
          <dc:type>InProceedings</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/DagSemProc.07431.1</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-12736</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07431.1</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
