No open-access location is known for this record yet.
No open-access location is known for this record yet.
This paper provides an asymptotically efficient algorithm for the allocation of computing resources to the problem of Monte Carlo integration of continuous-time security prices. The tradeoff between increasing the number of time intervals per unit of time and increasing the number of simulations, given a limited budget of computer time, is resolved for first-order discretization schemes (such as Euler) as well as second- and higher-order schemes (such as those of Milshtein or Talay).
Loading…
Stored only when both papers are in the corpus — 173 citations exist upstream.
Imported from OpenAlex (CC0) — nothing here is generated.