Related papers: Looking Forward to Pricing Options from Binomial T…
The real options approach is now considered an effective alternative to the corporate DCF model for a feasibility study. The current paper offers a practical methodology employing binomial trees and real options techniques for evaluating…
Random forests have become an established tool for classification and regression, in particular in high-dimensional settings and in the presence of complex predictor-response relationships. For bounded outcome variables restricted to the…
We consider the valuation of contingent claims with delayed dynamics in a Black&Scholes complete market model. We find a pricing formula that can be decomposed into terms reflecting the market values of the past and the present, showing how…
This paper introduces a series of methods for traversing binary decision trees using arithmetic operations. We present a suite of binary tree traversal algorithms that leverage novel representation matrices to flatten the full binary tree…
In this paper we develop an algorithm to calculate the prices and Greeks of barrier options in a hyper-exponential additive model with piecewise constant parameters. We obtain an explicit semi-analytical expression for the first-passage…
Barrier options are one of the most widely traded exotic options on stock exchanges. In this paper, we develop a new stochastic simulation method for pricing barrier options and estimating the corresponding execution probabilities. We show…
This study deals with the problem of pricing compound options when the underlying asset follows a mixed fractional Brownian motion with jumps. An analytic formula for compound options is derived under the risk neutral measure. Then, these…
The pricing and hedging of a general class of options (including American, Bermudan and European options) on multiple assets are studied in the context of currency markets where trading is subject to proportional transaction costs, and…
Options on baskets (linear combinations) of assets are notoriously challenging to price using even the simplest log-normal continuous-time stochastic models for the individual assets. The paper [5] gives a closed form approximation formula…
In this work we prove decidability of the model-checking problem for safe recursion schemes against properties defined by alternating B-automata. We then exploit this result to show how to compute downward closures of languages of finite…
We present an algorithm, called the Offset Tree, for learning to make decisions in situations where the payoff of only one choice is observed, rather than all choices. The algorithm reduces this setting to binary classification, allowing…
Consider a discrete finite-dimensional, Markovian market model. In this setting, discretely sampled American options can be priced using the so-called ``non-recombining'' tree algorithm. By successively increasing the number of exercise…
A decision tree looks like a simple directed acyclic computational graph, where only the leaf nodes specify the output values and the non-terminals specify their tests or split conditions. From the numerical perspective, we express decision…
We introduce a new method to price American options based on Chebyshev interpolation. In each step of a dynamic programming time-stepping we approximate the value function with Chebyshev polynomials. The key advantage of this approach is…
In this paper, we introduce two novel methods to solve the American-style option pricing problem and its dual form at the same time using neural networks. Without applying nested Monte Carlo, the first method uses a series of neural…
In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics. The approach allows for conditional reasoning over arguments and boolean combination of arguments, with…
The study of prime divisibility plays a crucial role in number theory. The $p$-adic valuation of a number is the highest power of a prime, $p$, that divides that number. Using this valuation, we construct $p$-adic valuation trees to…
Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…
A new model for the stock market price analysis is proposed. It is suggested to look at price as an everywhere discontinuous function of time of bounded variation.
In this paper we present an algorithm for pricing barrier options in one-dimensional Markov models. The approach rests on the construction of an approximating continuous-time Markov chain that closely follows the dynamics of the given…