<?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-21T19:24:49Z</responseDate>
  <request identifier="2298" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2298</identifier>
        <datestamp>2024-03-06T11:09:00Z</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>Evaluating Expectations of Functionals of Brownian Motions: a Multilevel Idea</dc:title>
          <dc:creator>Hickernell, Fred J.</dc:creator>
          <dc:creator>Müller-Gronbach, Thomas</dc:creator>
          <dc:creator>Niu, Ben</dc:creator>
          <dc:creator>Ritter, Klaus</dc:creator>
          <dc:subject>Brownian motions</dc:subject>
          <dc:subject>multilevel</dc:subject>
          <dc:subject>option pricing</dc:subject>
          <dc:subject>worst-case error</dc:subject>
          <dc:description>Prices of path dependent options may be modeled as expectations of functions of an infinite sequence of real variables.  This talk presents recent work on bounding the error of such expectations using quasi-Monte Carlo algorithms.  The expectation is approximated by an average of $n$ samples, and the functional of an infinite number of variables is approximated by a function of only $d$ variables.  A multilevel algorithm employing a sum of sample averages, each with different truncated dimensions, $d_l$, and different sample sizes, $n_l$, yields faster convergence than a single level algorithm.  This talk presents results in the worst-case error setting.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Fred J. Hickernell and Thomas Müller-Gronbach and Ben Niu and Klaus Ritter</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)</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.09391.3</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-22987</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.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>
