Chapter 1: The binomial asset pricing model

Size: px
Start display at page:

Download "Chapter 1: The binomial asset pricing model"

Transcription

1 Chapter 1: The binomial asset pricing model Simone Calogero April 17, 2015 Contents 1 The binomial model dimensional stock markets 4 3 Arbitrage portfolio 8 4 Implementation of the binomial model with Matlab 11 1 The binomial model The binomial asset pricing model, or simply the binomial model, is a model for the evolution in time of the price of a financial asset. It is typically applied to stocks, hence we denote by S(t) the price of the asset at time t. We are interested in monitoring the price in some finite time interval [0, T ], where T > 0 could be for instance the expiration date of an option on the stock. The price of the stock at the present time t = 0 is denoted by S 0 and is assumed to be known. In the binomial model it is imposed that the price of the stock can only change at some given pre-defined times 0 = t 0 < t 1 < t 2 < < t N = T ; moreover the price at time t i+1 depends only on the price at time t i and the result of tossing a coin. Precisely, letting u, d R, u > d, and p u (0, 1), we assume S(t i+1 ) = S(t i )e u, with probability p u, S(t i+1 ) = S(t i )e d, with probability p d = 1 p u, for all i = 0,..., N 1. Here we may interpret p u as the probability to get a head in a coin toss (p u = p d = 1/2 for a fair coin). We restrict to the standard binomial model, which assumes that the parameters u, d, p u are time-independent and that the stock pays no dividend in the interval [0, T ] (see Chapter 4 for a generalization of the binomial model). In the applications one typically chooses u > 0 and d < 0 (e.g., d = u is quite common), hence u stands for up, since S(t i+1 ) = S(t i )e u > S(t i ), while d stands for down, for 1

2 S(t i+1 ) = S(t i )e d < S(t i ). In the first case we say that the stock price goes up at time t i+1, in the second case that it goes down at time t i+1. Next we introduce a number of assumptions which simplify the analysis of the model without compromising its generality. Firstly we assume that the times t 0, t 1,... t N are equidistant, that is t i+1 t i = h > 0. In the applications the value of h must be chosen much smaller than T. Without loss of generality we can pick h = 1, and so t 1 = 1, t 2 = 2,... t N = T = N, with N >> 1. For instance, if N = 67 (the number of trading days in a period of 3 months), then h = 1 day and S(t), for t {1,... N}, may refer to the closing price of the stock at each day. It is convenient to denote I = {1,..., N}. Hence, from now on, we assume that the price of the stock in the binomial model is determined by the rule S(0) = S 0 and { S(t 1)e u, with probability p u S(t) =, t I. (1) S(t 1)e d, with probability p d = 1 p u Each possible sequence (S(1),..., S(N)) of the future stock prices determined by the binomial model is called a path of the stock price. Clearly, there exists 2 N possible paths of the stock price in a N-period model. Letting {u, d} N = {x = (x 1, x 2,..., x N ) R N : x t = u or x t = d, t I} be the space of all possible N-sequences of ups and downs, we obtain a unique path of the stock price (S(1),..., S(N)) for each x {u, d} N. For instance, for N = 3 and x = (u, u, u) the corresponding stock price path is given by S 0 S(1) = S 0 e u S(2) = S(1)e u = S 0 e 2u S(3) = S(2)e u = S 0 e 3u, while for x = (u, d, u) we obtain the path S 0 S(1) = S 0 e u S(2) = S(1)e d = S 0 e u+d S(3) = S(2)e u = S 0 e 2u+d. In general the possible paths of the stock price for the 3-period model can be represented as 2

3 u S(3) = S 0 e 3u S(0) = S 0 u d S(1) = S 0 e u S(1) = S 0 e d u d u d S(2) = S 0 e 2u S(2) = S 0 e u+d S(2) = S 0 e 2d d u d u S(3) = S 0 e 2u+d S(3) = S 0 e u+2d d S(3) = S 0 e 3d which is an example of binomial tree. Note that the admissible values for the price S(t) at time t are given by S(t) {S 0 e ku+(t k)d, k = 0,..., t}, for all t I, where k is the number of times that the price goes up up to the time t. Definition 1.1. Given x = (x 1,... x N ) {u, d} N, the binomial asset price S(t, x) at time t I corresponding to x is given by S(t, x) = S 0 exp(x 1 + x x t ). The vector S x = (S(1, x),... S(N, x)) is called a path of the stock price. Moreover we define the probability 1 of the path S x as P(S x ) = (p u ) Nu(x) (p d ) N d(x), where N u (x) is the number of u s in the sequence x and N d (x) = N N u (x) is the number of d s. The probability that the stock follows one of the two paths S x, S y is given by P(S x )+P(S y ) (and similarly for any number of paths). Exercise 1. Prove that x {u,d} N P(S x ) = 1. 1 We shall say more about the probabilistic interpretation of the binomial model in Chapter 4. 3

4 2 1+1 dimensional stock markets A 1+1 dimensional stock market is a market that consists of a stock and a bond. We model the price of the stock with the binomial model (1), while for the bond price we postulate a constant (instantaneous) interest rate r > 0. Hence the value at time t of the bond is given by B(t) = B 0 e rt, t I, (2) where B 0 is the present (at time t = 0) value of the bond. A portfolio process invested in a 1+1 dimensional stock market is a finite sequence {(h S (t), h B (t))} t I, where h S (t) is the (real 2 ) number of shares invested in the stock and h B (t) the number of shares invested in the bond during the time interval (t 1, t], t I. The initial position of the investor is given by (h S (0), h B (0)). Without loss of generality we assume that h S (0) = h S (1), h B (0) = h B (1), (3) i.e, (h S (1), h B (1)) is the investor position on the closed interval [0, 1] (and not just in the semi-open interval (0, 1]). Remark 2.1. It is clear that the investor will change the position on the stock and the bond according to the path followed by the stock price, and so (h S (t), h B (t)) is in general path-dependent. When we want to emphasize the dependence of a portfolio position on the path of the stock price we shall write h S (t) = h S (t, x), h B (t) = h B (t, x). The value of the portfolio process at time t is given by V (t) = h S (t)s(t) + h B (t)b(t). (4) We write V (t) = V (t, x) if we want to emphasize the dependence of the portfolio value on the path of the stock price. Clearly, V (t, x) = h S (t, x)s(t, x) + h B (t, x)b(t). We say that the portfolio process is self-financing if purchasing more shares of one asset is possible only by selling shares of the other asset for an equivalent value (and not by infusing new cash into the portfolio), and, conversely, if any cash obtained by selling one asset is immediately re-invested to buy shares of the other asset (and not withdrawn from the portfolio). To translate this condition into a mathematical formula, recall that (h S (t), h B (t)) is the investor position on the stock and the bond during the time interval (t 1, t]. Let 2 Recall that we assume that the agent can invest in any fractional number of shares of an asset. Of course in the applications this has to be rounded to an integer number. 4

5 V (t) be the value of this portfolio at the time t, given by (4). At the time t, the investor sells/buys shares of the assets. Let (h S (t + 1), h B (t + 1)) be the new position on the stock and the bond in the interval (t, t + 1]. Then the value of the new portfolio at time t is given by V (t) = h S (t + 1)S(t) + h B (t + 1)B(t). The difference V (t) V (t), if not zero, corresponds to cash withdrawn or added to the portfolio as a result of the change in the position on the assets. In a self-financing portfolio, however, this difference must be zero. We thus must have V (t) V (t) = 0, which leads to the following definition. Definition 2.2. A portfolio process {(h S (t), h B (t))} t I invested in a dimensional stock market is said to be self-financing if holds for all t I. h S (t)s(t 1) + h B (t)b(t 1) = h S (t 1)S(t 1) + h B (t 1)B(t 1) (5) Remark 2.3. Constant (i.e., time-independent) portfolio processes are clearly self-financing. In fact, (5) holds if h S (t) = h S (t 1) and h B (t) = h B (t 1), for all t I. In the next theorem we show that the self-financing property of a portfolio process is very restrictive: the value of a self-financing portfolio at time t = N determines the value of the portfolio at any earlier time t = 0,..., N 1. This result is crucial to justify our definition of fair price to European derivatives in the next chapter. Theorem 2.4. Let {(h S (t), h B (t))} t I be a self-financing portfolio process with value V (N) at time t = N. Define q u = er e d e u e d, Then for t = 0,... N 1, V (t) is given by V (t) = e r(n t) In particular, at time t = 0 we have V (0) = e rn q d = eu e r e u e d. (6) (x t+1,...,x N ) {u,d} N t q xt+1 q xn V (N, x). (7) x {u,d} N (q u ) Nu(x) (q d ) Nd(x) V (N, x). Proof. We prove the statement by induction on t = 0,... N 1. Step 1. We first prove it for t = N 1. In this case the sum in (7) is over two terms, one for which x N = u and one for which x N = d. Hence the claim becomes V (N 1) = e r [q u V (N, (x 1,..., x N 1, u)) + q d V (N, (x 1,..., x N 1, d))]. (8) 5

6 In the right hand side of (8) we replace and V (N, (x 1,..., x N 1, u)) = h S (N)S(N 1)e u + h B (N)B(N 1)e r V (N, (x 1,..., x N 1, d)) = h S (N)S(N 1)e d + h B (N)B(N 1)e r, which follow by the definition of portfolio value. So doing we obtain r.h.s (8) =e r [q u (h S (N)S(N 1)e u + h B (N)B(N 1)e r ) + q d (h S (N)S(N 1)e d + h B (N)B(N 1)e r )] = e r [h S (N)S(N 1)(e u q u + e d q d ) + h B (N)B(N 1)e r (q u + q d )] = e r [h S (N)S(N 1)e r + h B (N)B(N 1)e r ] = h S (N)S(N 1) + h B (N)B(N 1), (9) where we used that e u q u + e d q d = e r and q u + q d = 1. By the definition of self-financing portfolio process, the expression in the last line of (9) is V (N 1), which proves the claim for t = N 1. Step 2. Now assume that the statement is true at time t + 1, i.e., V (t + 1) = e r(n t 1) q xt+2 q xn V (N, x). (x t+2,...x N ) {u,d} N t 1 Step 3. We now prove it at time t. Let V u (t + 1) V (t + 1) assuming x t+1 = u = h S (t + 1)S(t)e u + h B (t + 1)B(t)e r and similarly we define V d (t + 1). Proceeding exactly as in (9) above gives the identity e r [q u V u (t + 1) + q d V d (t + 1)] = h S (t + 1)S(t) + h B (t + 1)B(t). By the self-financing property, the right hand side is V (t). Thus V (t) = e r [q u V u (t + 1) + q d V d (t + 1)]. (10) On the other hand, by the induction hypothesis of step 2 we have V u (t + 1) = e r(n t 1) q xt+2 q xn V (N, x 1,..., x t, u, x t+2,..., x N ), (x t+2,...,x N ) {u,d} N t 1 V d (t + 1) = e r(n t 1) q xt+2 q xn V (N, x 1,..., x t, d, x t+2,..., x N ). (x t+2,...,x N ) {u,d} N t 1 6

7 Replacing in (10) we obtain V (t) = e r(n t) q u q xt+2 q xn V (N, x 1,..., x t, u, x t+2,..., x N ) (x t+2,...,x N ) {u,d} N t 1 + q d q xt+2 q xn V (N, x 1,..., x t, d, x t+2,..., x N ) (x t+1,...,x N ) {u,d} N t 1 = e r(n t) q xt+1 q xn V (N, x), (x t+1,...x N ) {u,d} N t which completes the proof. Remark 2.5. As the sum in (7) is over (x t+1,..., x N ), while V (N) depends on the full path x {u, d} N, then V (t) depends on the path of the stock price up to time t, i.e., V (t) = V (t, x 1, x 2,..., x t ). In the process of proving Theorem 2.4 we have also established the important formula (10). As this formula will be used several times in the next chapters, it deserves to be stated in a separate theorem. Theorem 2.6. The value of a self-financing portfolio invested in a 1+1 dimensional stock market satisfies the recurrence formula where V (t 1) = e r [q u V u (t) + q d V d (t)], for t I, (11) V u (t) = h S (t)s(t 1)e u + h B (t)b(t 1)e r is the value of the portfolio at time t, assuming that the stock price goes up at this time, and V d (t) = h S (t)s(t 1)e d + h B (t)b(t 1)e r is the value of the portfolio at time t, assuming that the stock price goes down at this time. Example. We conclude this section with an example of application of (7) and (11). Assume N = 2 and consider the constant (and then self-financing) portfolio h S (t) = 1, h B (t) = 1, t = 0, 1, 2. Then V (2) = S(2) B(2), B(2) = B 0 e 2r. The possible paths are x {u, d} 2. Hence S(2) can take 3 possible values: 1. S(2) = S(2, (u, u)) = S 0 e 2u, for x = (u, u); 2. S(2) = S(2, (u, d)) = S(2, (d, u)) = S 0 e u+d, for x = (u, d) or x = (d, u); 7

8 3. S(2) = S(2, (d, d)) = S 0 e 2d, for x = (d, d). The value of the portfolio at time t = 2 along all possible paths is 1. V (2) = V (2, (u, u)) = S 0 e 2u B 0 e 2r, for x = (u, u); 2. V (2) = V (2, (u, d)) = V (2, (d, u)) = S 0 e u+d B 0 e 2r, for x = (u, d) or x = (d, u); 3. V (2) = V (2, (d, d)) = S 0 e 2d B 0 e 2r, for x = (d, d). Hence (7) gives, for N = 2, t = 1, and x 1 = u, V (1, u) = e r (q u V (2, (u, u)) + q d V (2, (u, d)) = e r (q u (S 0 e 2u B 0 e 2r ) + q d (S 0 e u+d B 0 e 2r )). Using the identities q u e u + q d e d = e r and q u + q d = 1, we obtain V (1, u) = S 0 e u B 0 e r, (12) which if of course correct because the right hand side is S(1, (u, u)) B(1), i.e., the value of the portfolio at time t = 1, assuming that the price of the stock goes up at this time. Similarly, applying (7) for x 1 = d we obtain the (correct) formula Finally we compute V (0) with (7): V (1, d) = S 0 e d B 0 e r. (13) V (0) = e 2r [(q u ) 2 V (2, (u, u)) + q u q d V (2, (u, d)) + q d q u V (2, (d, u)) + (q d ) 2 V (2, (d, d))]. After the proper simplifications we obtain V (0) = S 0 B 0, which is of course correct by definition of portfolio value at time t = 0. Note that we obtain the same result by applying the recurrence formula (11). In fact, as V u (1) = V (1, u) and V d (1) = V (1, d), and using (12), (13), we obtain V (0) = e r (q u V u (1) + q d V d (1)) = e r ((q u e u + q d e d )S 0 (q u + q d )e r ) = S 0 B 0. 3 Arbitrage portfolio Our next purpose is to prove that the 1+1 dimensional market introduced in the previous section is arbitrage free, provided its parameters satisfy d < r < u (no condition is required on the probability p u ). To achieve this we first need to introduce the precise definition of arbitrage portfolio. Definition 3.1. A portfolio process {(h S (t), h B (t)} t I invested in a 1+1 dimensional stock market is called an arbitrage portfolio if its value V (t) satisfies 8

9 V (0) = 0; V (N, x) 0, for all x {u, d} N ; There exists y {u, d} N such that V (N, y) > 0. We say that a 1+1 dimensional stock market is arbitrage-free if there exist no self-financing arbitrage portfolio process invested in the stock and the bond. Let us comment on the previous definition. Condition 1) means that no initial wealth is required to set up the portfolio, i.e., the long and short positions on the two assets are perfectly balanced. In particular, anyone can (in principle) open such portfolio. Condition 2) means that the investor is sure not to loose money with this investment: regardless of the path followed by the stock price, the return of the portfolio is always non-negative. Condition 3) means that there is a strictly positive probability to make a profit, since along at least one path of the stock price the return of the portfolio is strictly positive. We remark that in the definition of arbitrage-free market the property self-financing is sometimes dropped. Theorem 3.2. A 1+1 dimensional stock market is arbitrage free if and only if d < r < u. Proof. We divide the proof in two steps. In step 1 we prove the claim for the 1-period model, i.e., N = 1. The (easy) generalization to the multiperiod model (N > 1) is carried out in step 2. Note also the claim of the theorem is logically equivalent to the following: There exists a self-financing arbitrage portfolio in the 1+1 dimensional stock market if and only if r / (d, u). It is the latter claim which is actually proved below. Step 1: the 1-period model. Because of our convention (3), we can set h S (0) = h S (1) = h S, h B (0) = h B (1) = h B, i.e., the portfolio position in the 1-period model is constant (and thus self-financing) over the interval [0, 1]. The value of the portfolio at time t = 0 is V (0) = h S S 0 + h B B 0, while at time t = 1 it is given by one of the following: if the stock price goes up at time t = 1, or V (1) = V (1, u) = h S S 0 e u + h B B 0 e r, V (1) = V (1, d) = h S S 0 e d + h B B 0 e r, if the stock price goes down at time t = 1. Thus the portfolio is an arbitrage if V (0) = 0, i.e., h S S 0 + h B B 0 = 0, (14) 9

10 if V (1) 0, i.e., h S S 0 e u + h B B 0 e r 0, (15) h S S 0 e d + h B B 0 e r 0, (16) and if at least one of the inequalities in (15)-(16) is strict. Now assume that (h S, h B ) is an arbitrage portfolio. From (14) we have h B B 0 = h S S 0 and therefore (15)-(16) become h S S 0 (e u e r ) 0, (17) h S S 0 (e d e r ) 0. (18) Since at least one of the inequalities must be strict, then h S 0. If h S > 0, then (17) gives u r, while (18) gives d r. As u > d, the last two inequalities are equivalent to r d. Similarly, for h S < 0 we obtain u r and d r which, again due to u > d, are equivalent to r u. We conclude that the existence of an arbitrage portfolio implies r d or r u, that is r / (d, u). This proves that for r (d, u) there is no arbitrage portfolio in the one period model, and thus the if part of the theorem is proved for N = 1. To prove the only if part, i.e., the fact that r (d, u) is necessary for the absence of arbitrages, we construct an arbitrage portfolio when r / (d, u). Assume r d. Let us pick h S = 1 and h B = S 0 /B 0. Then V (0) = 0. Moreover (16) is trivially satisfied and, since u > d, h S S 0 e u + h B B 0 e r = S 0 (e u e r ) > S 0 (e d e r ) 0, hence the inequality (15) is strict. This shows that one can construct an arbitrage portfolio if r d and a similar argument can be used to find an arbitrage portfolio when r u. The proof of the theorem for the 1-period model is complete. Step 2: the multiperiod model. Let r / (d, u). As shown in the previous step, there exists an arbitrage portfolio (h S, h B ) in the single period model. We can now build a selffinancing arbitrage portfolio process {(h S (t), h B (t))} t I for the multiperiod model by investing at time t = 1 the whole value of the portfolio (h S, h B ) in the bond. Hence the value of this portfolio process satisfies V (0) = 0 and V (N, x) = V (1, x)e r(n 1) V (1, x) 0 along every path x {u, d} N. Moreover, since (h s, h B ) is an arbitrage, then V (1, y) > 0 along some path and thus V (N, y) V (1, y) > 0. Hence the constructed self-financing portfolio process {(h S (t), h B (t))} t I is an arbitrage and the if part of the theorem is proved. To prove the only if part for the multiperiod model, we use that 3, by Theorem 2.4, V (0) = e rn (q u ) Nu(x) (q d ) Nd(x) V (N, x), x {u,d} N 3 Note that this is the only part of the proof where we need to use that the portfolio is self-financing. 10

11 where q u, q d are given by (6), N u (x) is the number of ups in x and N d (x) = N N u (x) the number of downs. Now, assume that the portfolio is an arbitrage. Then V (0) = 0 and V (N, x) 0. Of course, the above sum can be restricted to the paths along which V (N, x) > 0, which exist since the portfolio is an arbitrage. But then the sum can be zero only if either one of the factors q u, q d is zero, or if they have opposite sign. Since u > d, the denominator in the expressions (6) is positive, hence q u = 0 resp. q d = 0 r = d resp. u = r, (q u > 0, q d < 0) resp. (q u < 0, q d > 0) u < r resp. r < d. We conclude that the existence of a self-financing arbitrage portfolio entails r / (d, u), which completes the proof of the theorem. Remark 3.3. When the 1+1 dimensional stock market is arbitrage-free, i.e.,, for d < r < u, the parameters q u, q d satisfy q u (0, 1), q d = 1 q u (0, 1), hence the pair q u, q d defines a probability, which is called the risk-neutral probability. The reason for this terminology will become clear in Chapter 4. 4 Implementation of the binomial model with Matlab It is a simple matter to implement the binomial asset pricing model with Matlab. The following code defines a function BinomialStock, which generates a binomial tree for the stock price. function S=BinomialStock(u,d,s,N) S=zeros(N+1); S(1,1)=s; for j=1:n S(1,j+1)=S(1,j)*exp(u); for i=1:j S(i+1,j+1)=S(i,j)*exp(d); end end The arguments of the function are the parameters u, d, the initial price of the stock s and the number of step N in the binomial model. The function returns an upper-triangular (N + 1) (N + 1) matrix S. The column j contains, in decreasing order along rows, the possible prices of the stock at time j 1. A path of the stock price is obtained by moving from each column to next one by either stays in the same row (which means that the price went up at this step) or going down one row (which means that the price went down at this step). 11

12 Exercise 2. Define a function RandomPath(S,p), which generates a random path from the binomial tree S created with the function BinomialStock and compute the probability of this path. The argument p is the probability that the price of the stock goes up. Plot the price of the stock as a function of time t {0,..., N}. We remark that it is impossible to generate all possible 2 N paths of the stock price. Even for a relatively small number of steps, like N 50, the number of admissible paths is too big. Note also that the probability of each single path is practically zero for N 10. In Chapter 4 we shall learn how to compute the (much more interesting) probability that the price S(t) lies within a given range [a, b], i.e., P(a < S(t) < b). 12

7: The CRR Market Model

7: The CRR Market Model Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney MATH3075/3975 Financial Mathematics Semester 2, 2015 Outline We will examine the following issues: 1 The Cox-Ross-Rubinstein

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING

THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING 1. Introduction The Black-Scholes theory, which is the main subject of this course and its sequel, is based on the Efficient Market Hypothesis, that arbitrages

More information

MTH6120 Further Topics in Mathematical Finance Lesson 2

MTH6120 Further Topics in Mathematical Finance Lesson 2 MTH6120 Further Topics in Mathematical Finance Lesson 2 Contents 1.2.3 Non-constant interest rates....................... 15 1.3 Arbitrage and Black-Scholes Theory....................... 16 1.3.1 Informal

More information

4: SINGLE-PERIOD MARKET MODELS

4: SINGLE-PERIOD MARKET MODELS 4: SINGLE-PERIOD MARKET MODELS Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2015 B. Goldys and M. Rutkowski (USydney) Slides 4: Single-Period Market

More information

Example 1. Consider the following two portfolios: 2. Buy one c(s(t), 20, τ, r) and sell one c(s(t), 10, τ, r).

Example 1. Consider the following two portfolios: 2. Buy one c(s(t), 20, τ, r) and sell one c(s(t), 10, τ, r). Chapter 4 Put-Call Parity 1 Bull and Bear Financial analysts use words such as bull and bear to describe the trend in stock markets. Generally speaking, a bull market is characterized by rising prices.

More information

1 Introduction to Option Pricing

1 Introduction to Option Pricing ESTM 60202: Financial Mathematics Alex Himonas 03 Lecture Notes 1 October 7, 2009 1 Introduction to Option Pricing We begin by defining the needed finance terms. Stock is a certificate of ownership of

More information

One Period Binomial Model

One Period Binomial Model FIN-40008 FINANCIAL INSTRUMENTS SPRING 2008 One Period Binomial Model These notes consider the one period binomial model to exactly price an option. We will consider three different methods of pricing

More information

Mathematical Induction

Mathematical Induction Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How

More information

COMPLETE MARKETS DO NOT ALLOW FREE CASH FLOW STREAMS

COMPLETE MARKETS DO NOT ALLOW FREE CASH FLOW STREAMS COMPLETE MARKETS DO NOT ALLOW FREE CASH FLOW STREAMS NICOLE BÄUERLE AND STEFANIE GRETHER Abstract. In this short note we prove a conjecture posed in Cui et al. 2012): Dynamic mean-variance problems in

More information

Chapter 2: Binomial Methods and the Black-Scholes Formula

Chapter 2: Binomial Methods and the Black-Scholes Formula Chapter 2: Binomial Methods and the Black-Scholes Formula 2.1 Binomial Trees We consider a financial market consisting of a bond B t = B(t), a stock S t = S(t), and a call-option C t = C(t), where the

More information

The Discrete Binomial Model for Option Pricing

The Discrete Binomial Model for Option Pricing The Discrete Binomial Model for Option Pricing Rebecca Stockbridge Program in Applied Mathematics University of Arizona May 4, 2008 Abstract This paper introduces the notion of option pricing in the context

More information

Binomial lattice model for stock prices

Binomial lattice model for stock prices Copyright c 2007 by Karl Sigman Binomial lattice model for stock prices Here we model the price of a stock in discrete time by a Markov chain of the recursive form S n+ S n Y n+, n 0, where the {Y i }

More information

Mathematical finance and linear programming (optimization)

Mathematical finance and linear programming (optimization) Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may

More information

From Binomial Trees to the Black-Scholes Option Pricing Formulas

From Binomial Trees to the Black-Scholes Option Pricing Formulas Lecture 4 From Binomial Trees to the Black-Scholes Option Pricing Formulas In this lecture, we will extend the example in Lecture 2 to a general setting of binomial trees, as an important model for a single

More information

Lecture 3: Put Options and Distribution-Free Results

Lecture 3: Put Options and Distribution-Free Results OPTIONS and FUTURES Lecture 3: Put Options and Distribution-Free Results Philip H. Dybvig Washington University in Saint Louis put options binomial valuation what are distribution-free results? option

More information

Numerical Methods for Option Pricing

Numerical Methods for Option Pricing Chapter 9 Numerical Methods for Option Pricing Equation (8.26) provides a way to evaluate option prices. For some simple options, such as the European call and put options, one can integrate (8.26) directly

More information

Model-Free Boundaries of Option Time Value and Early Exercise Premium

Model-Free Boundaries of Option Time Value and Early Exercise Premium Model-Free Boundaries of Option Time Value and Early Exercise Premium Tie Su* Department of Finance University of Miami P.O. Box 248094 Coral Gables, FL 33124-6552 Phone: 305-284-1885 Fax: 305-284-4800

More information

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers. MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P

More information

Lecture 5: Put - Call Parity

Lecture 5: Put - Call Parity Lecture 5: Put - Call Parity Reading: J.C.Hull, Chapter 9 Reminder: basic assumptions 1. There are no arbitrage opportunities, i.e. no party can get a riskless profit. 2. Borrowing and lending are possible

More information

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)! Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

More information

The Black-Scholes Formula

The Black-Scholes Formula FIN-40008 FINANCIAL INSTRUMENTS SPRING 2008 The Black-Scholes Formula These notes examine the Black-Scholes formula for European options. The Black-Scholes formula are complex as they are based on the

More information

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

More information

LOGNORMAL MODEL FOR STOCK PRICES

LOGNORMAL MODEL FOR STOCK PRICES LOGNORMAL MODEL FOR STOCK PRICES MICHAEL J. SHARPE MATHEMATICS DEPARTMENT, UCSD 1. INTRODUCTION What follows is a simple but important model that will be the basis for a later study of stock prices as

More information

FINANCIAL OPTION ANALYSIS HANDOUTS

FINANCIAL OPTION ANALYSIS HANDOUTS FINANCIAL OPTION ANALYSIS HANDOUTS 1 2 FAIR PRICING There is a market for an object called S. The prevailing price today is S 0 = 100. At this price the object S can be bought or sold by anyone for any

More information

Institutional Finance 08: Dynamic Arbitrage to Replicate Non-linear Payoffs. Binomial Option Pricing: Basics (Chapter 10 of McDonald)

Institutional Finance 08: Dynamic Arbitrage to Replicate Non-linear Payoffs. Binomial Option Pricing: Basics (Chapter 10 of McDonald) Copyright 2003 Pearson Education, Inc. Slide 08-1 Institutional Finance 08: Dynamic Arbitrage to Replicate Non-linear Payoffs Binomial Option Pricing: Basics (Chapter 10 of McDonald) Originally prepared

More information

Option Valuation. Chapter 21

Option Valuation. Chapter 21 Option Valuation Chapter 21 Intrinsic and Time Value intrinsic value of in-the-money options = the payoff that could be obtained from the immediate exercise of the option for a call option: stock price

More information

Chapter 1: Financial Markets and Financial Derivatives

Chapter 1: Financial Markets and Financial Derivatives Chapter 1: Financial Markets and Financial Derivatives 1.1 Financial Markets Financial markets are markets for financial instruments, in which buyers and sellers find each other and create or exchange

More information

Option Basics. c 2012 Prof. Yuh-Dauh Lyuu, National Taiwan University Page 153

Option Basics. c 2012 Prof. Yuh-Dauh Lyuu, National Taiwan University Page 153 Option Basics c 2012 Prof. Yuh-Dauh Lyuu, National Taiwan University Page 153 The shift toward options as the center of gravity of finance [... ] Merton H. Miller (1923 2000) c 2012 Prof. Yuh-Dauh Lyuu,

More information

American Options. An Undergraduate Introduction to Financial Mathematics. J. Robert Buchanan. J. Robert Buchanan American Options

American Options. An Undergraduate Introduction to Financial Mathematics. J. Robert Buchanan. J. Robert Buchanan American Options American Options An Undergraduate Introduction to Financial Mathematics J. Robert Buchanan 2010 Early Exercise Since American style options give the holder the same rights as European style options plus

More information

Options Markets: Introduction

Options Markets: Introduction Options Markets: Introduction Chapter 20 Option Contracts call option = contract that gives the holder the right to purchase an asset at a specified price, on or before a certain date put option = contract

More information

On Black-Scholes Equation, Black- Scholes Formula and Binary Option Price

On Black-Scholes Equation, Black- Scholes Formula and Binary Option Price On Black-Scholes Equation, Black- Scholes Formula and Binary Option Price Abstract: Chi Gao 12/15/2013 I. Black-Scholes Equation is derived using two methods: (1) risk-neutral measure; (2) - hedge. II.

More information

Martingale Pricing Applied to Options, Forwards and Futures

Martingale Pricing Applied to Options, Forwards and Futures IEOR E4706: Financial Engineering: Discrete-Time Asset Pricing Fall 2005 c 2005 by Martin Haugh Martingale Pricing Applied to Options, Forwards and Futures We now apply martingale pricing theory to the

More information

Review of Basic Options Concepts and Terminology

Review of Basic Options Concepts and Terminology Review of Basic Options Concepts and Terminology March 24, 2005 1 Introduction The purchase of an options contract gives the buyer the right to buy call options contract or sell put options contract some

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

More information

K 1 < K 2 = P (K 1 ) P (K 2 ) (6) This holds for both American and European Options.

K 1 < K 2 = P (K 1 ) P (K 2 ) (6) This holds for both American and European Options. Slope and Convexity Restrictions and How to implement Arbitrage Opportunities 1 These notes will show how to implement arbitrage opportunities when either the slope or the convexity restriction is violated.

More information

3. Mathematical Induction

3. Mathematical Induction 3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

More information

MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 289 PROBLEM SET 4: NUMBER THEORY MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

More information

Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

More information

Basic Probability Concepts

Basic Probability Concepts page 1 Chapter 1 Basic Probability Concepts 1.1 Sample and Event Spaces 1.1.1 Sample Space A probabilistic (or statistical) experiment has the following characteristics: (a) the set of all possible outcomes

More information

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem Time on my hands: Coin tosses. Problem Formulation: Suppose that I have

More information

NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

More information

People have thought about, and defined, probability in different ways. important to note the consequences of the definition:

People have thought about, and defined, probability in different ways. important to note the consequences of the definition: PROBABILITY AND LIKELIHOOD, A BRIEF INTRODUCTION IN SUPPORT OF A COURSE ON MOLECULAR EVOLUTION (BIOL 3046) Probability The subject of PROBABILITY is a branch of mathematics dedicated to building models

More information

1 if 1 x 0 1 if 0 x 1

1 if 1 x 0 1 if 0 x 1 Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

More information

4. Continuous Random Variables, the Pareto and Normal Distributions

4. Continuous Random Variables, the Pareto and Normal Distributions 4. Continuous Random Variables, the Pareto and Normal Distributions A continuous random variable X can take any value in a given range (e.g. height, weight, age). The distribution of a continuous random

More information

Practical Guide to the Simplex Method of Linear Programming

Practical Guide to the Simplex Method of Linear Programming Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear

More information

Section 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4.

Section 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4. Difference Equations to Differential Equations Section. The Sum of a Sequence This section considers the problem of adding together the terms of a sequence. Of course, this is a problem only if more than

More information

Mathematical Induction

Mathematical Induction Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

More information

Inner Product Spaces

Inner Product Spaces Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

More information

k, then n = p2α 1 1 pα k

k, then n = p2α 1 1 pα k Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

More information

6.3 Conditional Probability and Independence

6.3 Conditional Probability and Independence 222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

More information

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS. Christopher Heil Georgia Institute of Technology WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

More information

PERPETUITIES NARRATIVE SCRIPT 2004 SOUTH-WESTERN, A THOMSON BUSINESS

PERPETUITIES NARRATIVE SCRIPT 2004 SOUTH-WESTERN, A THOMSON BUSINESS NARRATIVE SCRIPT 2004 SOUTH-WESTERN, A THOMSON BUSINESS NARRATIVE SCRIPT: SLIDE 2 A good understanding of the time value of money is crucial for anybody who wants to deal in financial markets. It does

More information

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

More information

Computational Finance Options

Computational Finance Options 1 Options 1 1 Options Computational Finance Options An option gives the holder of the option the right, but not the obligation to do something. Conversely, if you sell an option, you may be obliged to

More information

Lecture 11. Sergei Fedotov. 20912 - Introduction to Financial Mathematics. Sergei Fedotov (University of Manchester) 20912 2010 1 / 7

Lecture 11. Sergei Fedotov. 20912 - Introduction to Financial Mathematics. Sergei Fedotov (University of Manchester) 20912 2010 1 / 7 Lecture 11 Sergei Fedotov 20912 - Introduction to Financial Mathematics Sergei Fedotov (University of Manchester) 20912 2010 1 / 7 Lecture 11 1 American Put Option Pricing on Binomial Tree 2 Replicating

More information

E3: PROBABILITY AND STATISTICS lecture notes

E3: PROBABILITY AND STATISTICS lecture notes E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................

More information

1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let

1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let Copyright c 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n 0}, a random time τ is a discrete random variable on the same probability space as

More information

How To Price A Call Option

How To Price A Call Option Now by Itô s formula But Mu f and u g in Ū. Hence τ θ u(x) =E( Mu(X) ds + u(x(τ θ))) 0 τ θ u(x) E( f(x) ds + g(x(τ θ))) = J x (θ). 0 But since u(x) =J x (θ ), we consequently have u(x) =J x (θ ) = min

More information

Forward Price. The payoff of a forward contract at maturity is S T X. Forward contracts do not involve any initial cash flow.

Forward Price. The payoff of a forward contract at maturity is S T X. Forward contracts do not involve any initial cash flow. Forward Price The payoff of a forward contract at maturity is S T X. Forward contracts do not involve any initial cash flow. The forward price is the delivery price which makes the forward contract zero

More information

Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

More information

CHAPTER 7: PROPERTIES OF STOCK OPTION PRICES

CHAPTER 7: PROPERTIES OF STOCK OPTION PRICES CHAPER 7: PROPERIES OF SOCK OPION PRICES 7.1 Factors Affecting Option Prices able 7.1 Summary of the Effect on the Price of a Stock Option of Increasing One Variable While Keeping All Other Fixed Variable

More information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab

Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab Monte Carlo Simulation: IEOR E4703 Fall 2004 c 2004 by Martin Haugh Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab 1 Overview of Monte Carlo Simulation 1.1 Why use simulation?

More information

Buy a number of shares,, and invest B in bonds. Outlay for portfolio today is S + B. Tree shows possible values one period later.

Buy a number of shares,, and invest B in bonds. Outlay for portfolio today is S + B. Tree shows possible values one period later. Replicating portfolios Buy a number of shares,, and invest B in bonds. Outlay for portfolio today is S + B. Tree shows possible values one period later. S + B p 1 p us + e r B ds + e r B Choose, B so that

More information

Lecture 6: Option Pricing Using a One-step Binomial Tree. Friday, September 14, 12

Lecture 6: Option Pricing Using a One-step Binomial Tree. Friday, September 14, 12 Lecture 6: Option Pricing Using a One-step Binomial Tree An over-simplified model with surprisingly general extensions a single time step from 0 to T two types of traded securities: stock S and a bond

More information

Chapter Two. THE TIME VALUE OF MONEY Conventions & Definitions

Chapter Two. THE TIME VALUE OF MONEY Conventions & Definitions Chapter Two THE TIME VALUE OF MONEY Conventions & Definitions Introduction Now, we are going to learn one of the most important topics in finance, that is, the time value of money. Note that almost every

More information

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12 CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

More information

2. Exercising the option - buying or selling asset by using option. 3. Strike (or exercise) price - price at which asset may be bought or sold

2. Exercising the option - buying or selling asset by using option. 3. Strike (or exercise) price - price at which asset may be bought or sold Chapter 21 : Options-1 CHAPTER 21. OPTIONS Contents I. INTRODUCTION BASIC TERMS II. VALUATION OF OPTIONS A. Minimum Values of Options B. Maximum Values of Options C. Determinants of Call Value D. Black-Scholes

More information

4.5 Linear Dependence and Linear Independence

4.5 Linear Dependence and Linear Independence 4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then

More information

6.4 Normal Distribution

6.4 Normal Distribution Contents 6.4 Normal Distribution....................... 381 6.4.1 Characteristics of the Normal Distribution....... 381 6.4.2 The Standardized Normal Distribution......... 385 6.4.3 Meaning of Areas under

More information

LS.6 Solution Matrices

LS.6 Solution Matrices LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions

More information

Dynamic Trading Strategies

Dynamic Trading Strategies Dynamic Trading Strategies Concepts and Buzzwords Multi-Period Bond Model Replication and Pricing Using Dynamic Trading Strategies Pricing Using Risk- eutral Probabilities One-factor model, no-arbitrage

More information

The Binomial Option Pricing Model André Farber

The Binomial Option Pricing Model André Farber 1 Solvay Business School Université Libre de Bruxelles The Binomial Option Pricing Model André Farber January 2002 Consider a non-dividend paying stock whose price is initially S 0. Divide time into small

More information

3 Some Integer Functions

3 Some Integer Functions 3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple

More information

T ( a i x i ) = a i T (x i ).

T ( a i x i ) = a i T (x i ). Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)

More information

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish

More information

Note on growth and growth accounting

Note on growth and growth accounting CHAPTER 0 Note on growth and growth accounting 1. Growth and the growth rate In this section aspects of the mathematical concept of the rate of growth used in growth models and in the empirical analysis

More information

CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 Solutions CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

More information

The Determinant: a Means to Calculate Volume

The Determinant: a Means to Calculate Volume The Determinant: a Means to Calculate Volume Bo Peng August 20, 2007 Abstract This paper gives a definition of the determinant and lists many of its well-known properties Volumes of parallelepipeds are

More information

6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation

6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation 6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation Daron Acemoglu and Asu Ozdaglar MIT November 2, 2009 1 Introduction Outline The problem of cooperation Finitely-repeated prisoner s dilemma

More information

Indiana State Core Curriculum Standards updated 2009 Algebra I

Indiana State Core Curriculum Standards updated 2009 Algebra I Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and

More information

Math 120 Final Exam Practice Problems, Form: A

Math 120 Final Exam Practice Problems, Form: A Math 120 Final Exam Practice Problems, Form: A Name: While every attempt was made to be complete in the types of problems given below, we make no guarantees about the completeness of the problems. Specifically,

More information

Reading 13 : Finite State Automata and Regular Expressions

Reading 13 : Finite State Automata and Regular Expressions CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model

More information

FIN-40008 FINANCIAL INSTRUMENTS SPRING 2008

FIN-40008 FINANCIAL INSTRUMENTS SPRING 2008 FIN-40008 FINANCIAL INSTRUMENTS SPRING 2008 Options These notes consider the way put and call options and the underlying can be combined to create hedges, spreads and combinations. We will consider the

More information

Additional questions for chapter 4

Additional questions for chapter 4 Additional questions for chapter 4 1. A stock price is currently $ 1. Over the next two six-month periods it is expected to go up by 1% or go down by 1%. The risk-free interest rate is 8% per annum with

More information

Just the Factors, Ma am

Just the Factors, Ma am 1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive

More information

Student Outcomes. Lesson Notes. Classwork. Discussion (10 minutes)

Student Outcomes. Lesson Notes. Classwork. Discussion (10 minutes) NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 5 8 Student Outcomes Students know the definition of a number raised to a negative exponent. Students simplify and write equivalent expressions that contain

More information

FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL

FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL STATIsTICs 4 IV. RANDOm VECTORs 1. JOINTLY DIsTRIBUTED RANDOm VARIABLEs If are two rom variables defined on the same sample space we define the joint

More information

5.1 Identifying the Target Parameter

5.1 Identifying the Target Parameter University of California, Davis Department of Statistics Summer Session II Statistics 13 August 20, 2012 Date of latest update: August 20 Lecture 5: Estimation with Confidence intervals 5.1 Identifying

More information

Fair Valuation and Hedging of Participating Life-Insurance Policies under Management Discretion

Fair Valuation and Hedging of Participating Life-Insurance Policies under Management Discretion Fair Valuation and Hedging of Participating Life-Insurance Policies under Management Discretion Torsten Kleinow Department of Actuarial Mathematics and Statistics and the Maxwell Institute for Mathematical

More information

Capital Structure. Itay Goldstein. Wharton School, University of Pennsylvania

Capital Structure. Itay Goldstein. Wharton School, University of Pennsylvania Capital Structure Itay Goldstein Wharton School, University of Pennsylvania 1 Debt and Equity There are two main types of financing: debt and equity. Consider a two-period world with dates 0 and 1. At

More information

Options. Moty Katzman. September 19, 2014

Options. Moty Katzman. September 19, 2014 Options Moty Katzman September 19, 2014 What are options? Options are contracts conferring certain rights regarding the buying or selling of assets. A European call option gives the owner the right to

More information

5.1 Radical Notation and Rational Exponents

5.1 Radical Notation and Rational Exponents Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots

More information

Tiers, Preference Similarity, and the Limits on Stable Partners

Tiers, Preference Similarity, and the Limits on Stable Partners Tiers, Preference Similarity, and the Limits on Stable Partners KANDORI, Michihiro, KOJIMA, Fuhito, and YASUDA, Yosuke February 7, 2010 Preliminary and incomplete. Do not circulate. Abstract We consider

More information

Full and Complete Binary Trees

Full and Complete Binary Trees Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full

More information

Solutions for Practice problems on proofs

Solutions for Practice problems on proofs Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some

More information

Probability Generating Functions

Probability Generating Functions page 39 Chapter 3 Probability Generating Functions 3 Preamble: Generating Functions Generating functions are widely used in mathematics, and play an important role in probability theory Consider a sequence

More information

Wald s Identity. by Jeffery Hein. Dartmouth College, Math 100

Wald s Identity. by Jeffery Hein. Dartmouth College, Math 100 Wald s Identity by Jeffery Hein Dartmouth College, Math 100 1. Introduction Given random variables X 1, X 2, X 3,... with common finite mean and a stopping rule τ which may depend upon the given sequence,

More information

The Basics of Interest Theory

The Basics of Interest Theory Contents Preface 3 The Basics of Interest Theory 9 1 The Meaning of Interest................................... 10 2 Accumulation and Amount Functions............................ 14 3 Effective Interest

More information