<?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-28T00:28:14Z</responseDate>
  <request identifier="2562" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2562</identifier>
        <datestamp>2024-03-06T11:09:13Z</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>False-name-Proof Combinatorial Auction Mechanisms</dc:title>
          <dc:creator>Yokoo, Makoto</dc:creator>
          <dc:subject>Combinatorial auctions</dc:subject>
          <dc:subject>mechanism design</dc:subject>
          <dc:subject>false-name bids</dc:subject>
          <dc:description>In Internet auctions, it is easy for a bidder to submit multiple bids&#13;
under multiple identifiers (e.g., multiple e-mail addresses).&#13;
If only one good is sold, a bidder cannot make any additional profit by using multiple bids. However, in combinatorial auctions, where multiple&#13;
goods are sold simultaneously, submitting multiple bids under fictitious names can be profitable. A bid made under a fictitious name is called a {em false-name bid}. In this talk, I describe the summary of existing works and open problems&#13;
on false-name bids.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Makoto Yokoo</dc:contributor>
          <dc:date>2010</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 10101, Computational Foundations of Social Choice (2010)</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.10101.3</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-25621</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10101.3</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>
