<?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:08:49Z</responseDate>
  <request identifier="993" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:993</identifier>
        <datestamp>2024-03-06T11:07:11Z</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>Optimal Bidding Strategies for Simultaneous Vickrey Auctions with Perfect Substitutes</dc:title>
          <dc:creator>Gerding, Enrico H.</dc:creator>
          <dc:creator>Dash, Rajdeep K.</dc:creator>
          <dc:creator>Yuen, David C. K.</dc:creator>
          <dc:creator>Jennings, Nicholas R.</dc:creator>
          <dc:subject>Bidding strategies</dc:subject>
          <dc:subject>Vickrey Auctions</dc:subject>
          <dc:subject>Perfect Substitutes</dc:subject>
          <dc:subject>Simultaneous Auctions</dc:subject>
          <dc:subject>Budget Constraint</dc:subject>
          <dc:subject>Global Bidder</dc:subject>
          <dc:description>We derive optimal bidding strategies for a global bidder who participates in multiple, simultaneous second-price auctions with perfect substitutes. We prove that, if everyone else bids locally in a single auction, the global bidder should always place non-zero bids in all available auctions, provided there are no budget constraints. With a budget, however, the optimal strategy is to bid locally if this budget is equal or less than the valuation. Furthermore, for a wide range of valuation distributions, we prove that the problem of finding the optimal bids reduces to two dimensions if all auctions are identical. Moreoever, we address markets with both sequential and simultaneous auctions, non-identical auctions, and the allocative efficiency of the market. Finally, by combining analystical and simulation results, we analyse equilibrium strategies in case of several global bidders. However, a stable solution is then only found if there are local bidders as well.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Enrico H. Gerding and Rajdeep K. Dash and David C. K. Yuen and Nicholas R. Jennings</dc:contributor>
          <dc:date>2007</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 6461, Negotiation and Market Engineering (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.06461.18</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-9934</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06461.18</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>
