<?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-30T00:07:07Z</responseDate>
  <request identifier="1161" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1161</identifier>
        <datestamp>2024-03-06T11:07:36Z</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>Inefficiency of equilibria in query auctions with continuous valuations</dc:title>
          <dc:creator>Grigorieva, Elena</dc:creator>
          <dc:creator>Herings, P. Jean-Jacques</dc:creator>
          <dc:creator>Müller, Rudolf</dc:creator>
          <dc:creator>Vermeulen, Dries</dc:creator>
          <dc:subject>Query auctions</dc:subject>
          <dc:subject>ex post equilibrium</dc:subject>
          <dc:subject>efficiency</dc:subject>
          <dc:description>We show that, when bidders have continuous valuations, any ex post &#13;
equilibrium in an ex post individually rational query auction can only be &#13;
ex post efficient when the running time of the auction is infinite for almost &#13;
all realizations of valuations of the bidders. In contrast we show that, &#13;
when we allow for inefficient allocations with arbitrarily small probability, &#13;
there is a query auction (to be more specific, a bisection auction) that attains this level of approximate efficiency in equilibrium, while additionally the &#13;
running time of the auction in equilibrium is finite for all realizations of &#13;
valuations.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Elena Grigorieva and P. Jean-Jacques Herings and Rudolf Müller and Dries Vermeulen</dc:contributor>
          <dc:date>2007</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 7271, Computational Social Systems and the Internet (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.07271.7</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-11616</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07271.7</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>
