<?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-19T15:49:52Z</responseDate>
  <request identifier="3545" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:3545</identifier>
        <datestamp>2024-03-06T10:28:59Z</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>Can online trading algorithms beat the market? An experimental evaluation</dc:title>
          <dc:creator>Iqbal, Javeria</dc:creator>
          <dc:creator>Ahmad, Iftikhar</dc:creator>
          <dc:creator>Schmidt, Günter</dc:creator>
          <dc:subject>Online Algorithms</dc:subject>
          <dc:subject>Experimental Evaluation</dc:subject>
          <dc:subject>Competitive Analysis</dc:subject>
          <dc:description>From experimental evaluation, we reasonably infer that online trading algorithms can beat the market. We consider the scenario of trading in financial market and present an extensive experimental study to answer the question "Can online trading algorithms beat the market?". We evaluate the selected set of online trading algorithms on DAX30 and measure the performance against buy-and-hold strategy. In order to compute the experimentally achieved competitive ratio, we also compare the set of algorithms against an optimum offline algorithm. To add further dimensionality into experimental setup, we use trading periods of various lengths and apply a number of evaluation criteria (such as annualized geometric returns, average period returns and experimentally achieved competitive ratio) to measure the performance of algorithms in short vs. Long term investment decisions. We highlight the best and worst performing algorithms and discuss the possible reasons for the performance behavior of algorithms.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Javeria Iqbal and Iftikhar Ahmad and Günter Schmidt</dc:contributor>
          <dc:date>2012</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 22, 3rd Student Conference on Operational Research (2012)</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/OASIcs.SCOR.2012.43</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-35455</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.43</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>
