نتایج جستجو برای: identity options
تعداد نتایج: 210728 فیلتر نتایج به سال:
Background: Electronic transactions are another form of transactions that are done through electronic tools such as mobile phones, computers, tablets, etc. Considering the synchronization of Iranchr('39')s economic system with the world and meeting the needs of the day, ensuring the correct conclusion of electronic transactions with the correct and ethical use of options is explored. The presen...
nowadays, new informational and communicative media, and the rate of their use by individuals have caused deep metamorphoses in the material and non-material dimensions of human lives, and individuals’ mental regulation. the use of these media, especially the internet and virtual social networks, among iranian teenagers has unnoticeably increased, and providing numerous facilities and options m...
Drawing on ethnographic research, this paper explores the reasons why and processes through which Greeks from former Soviet Union altered their self-identification after migration to ethnic homeland. Responding labelling by native doubts expressed about Greekness, most introduce themselves as Pontians, even though area of Pontos was not a marker identification for them in Union. They do so expr...
Modeling a nonlinear pay o¤ generating instrument is a challenging work. The models that are commonly used for pricing derivative might divided into two main classes; analytical and iterative models. This paper compares the Black-Scholes and binomial tree models.
We study a discrete time approximation scheme for the solution of a doubly reflected Backward Stochastic Differential Equation (DBBSDE in short) with jumps, driven by a Brownian motion and an independent compensated Poisson process. Moreover, we suppose that the obstacles are right continuous and left limited (RCLL) processes with predictable and totally inaccessible jumps and satisfy Mokobodzk...
The scattering number of a graph G, denoted sc(G), is defined by sc(G)=max{c(G−S)− |S| : S ⊆ V(G) and c(G−S)≠ 1} where c(G−S) denotes the number of components in G− S. It is one measure of graph vulnerability. In this paper, general results on the scattering number of a graph are considered. Firstly, some bounds on the scattering number are given. Further, scattering number of a binomial tree i...
This note contains two main results. (1) (Discrete time) Suppose S is a martingale whose marginal laws agree with a geometric simple random walk. (In financial terms, let S be a risk-neutral asset price and suppose the initial option prices agree with the Cox–Ross–Rubinstein binomial tree model.) Then S is a geometric simple random walk. (2) (Continuous time) Suppose S = S0eσX−σ 〈X〉/2 is a cont...
A wide range of graphs with regular structures are shown to be embeddable in an injured hypercube with faulty links. These include rings, linear paths, binomial trees, binary trees, meshes, tori, and many others. Unlike many existing algorithms which are capable of embedding only one type of graphs, our algorithm embeds the above graphs in a uniied way, all centered around a notion called edge ...
The binomial tree method, first proposed by Cox, Ross, and Rubinstein [Journal of Financial Economics, 7 (1979), pp. 229–263], is one of the most popular approaches to pricing options. By introducing an additional path-dependent variable, such methods can be readily extended to the valuation of path-dependent options. In this paper, using numerical analysis and the notion of viscosity solutions...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید