Lecture: Conditional Expectation

Similar documents
Lecture: Conditional Expectation

1 Lecture 25: Extreme values

STOCHASTIC MODELS LECTURE 1 MARKOV CHAINS. Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (ShenZhen) Sept.

Types Negative Base & Positive Gradient

CS 124 Math Review Section January 29, 2018

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Discrete Mathematics for CS Fall 2003 Wagner Lecture 3. Strong induction

Part 3: Inferential Statistics

Section 2: Estimation, Confidence Intervals and Testing Hypothesis

Lecture 1 Introduction to Probability and Set Theory Text: A Course in Probability by Weiss

Lecture Notes on Compositional Reasoning

Testing Series with Mixed Terms

- there will be midterm extra credit available (described after 2 nd midterm)

6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013 Transcript Tutorial:A Random Number of Coin Flips

2. Prime and Maximal Ideals

Warm-Up Problem. Please fill out your Teaching Evaluation Survey! Please comment on the warm-up problems if you haven t filled in your survey yet.

Lesson 2: Put a Label on That Number!

z x = f x (x, y, a, b), z y = f y (x, y, a, b). F(x, y, z, z x, z y ) = 0. This is a PDE for the unknown function of two independent variables.

Mathematical Foundations of Programming. Nicolai Kraus. Draft of February 15, 2018

Part 01 - Notes: Identifying Significant Figures

Lecture: Corporate Income Tax

An analogy from Calculus: limits

Lecture 02: Summations and Probability. Summations and Probability

University of Regina. Lecture Notes. Michael Kozdron

Chapter 2 Classical Probability Theories

Math 480 The Vector Space of Differentiable Functions

a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.

The problem of base rates

Preliminary Statistics Lecture 2: Probability Theory (Outline) prelimsoas.webs.com

The Halfers are right, but many were anyway wrong: Sleeping Beauty Problem

6.262: Discrete Stochastic Processes 2/2/11. Lecture 1: Introduction and Probability review

Economics 204 Fall 2011 Problem Set 2 Suggested Solutions

211 Real Analysis. f (x) = x2 1. x 1. x 2 1

experiment3 Introduction to Data Analysis

There are two types of electric charge

Chapter 4.1 Introduction to Relations

Topic 1: Propositional logic

COMP6463: λ-calculus

Special Theory of Relativity Prof. Dr. Shiva Prasad Department of Physics Indian Institute of Technology, Bombay

MATH 13100/58 Class 6

Our first case consists of those sequences, which are obtained by adding a constant number d to obtain subsequent elements:

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10

Assume that you have made n different measurements of a quantity x. Usually the results of these measurements will vary; call them x 1

CSE 21 Practice Exam for Midterm 2 Fall 2017

Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers

Fuzzy Systems. Introduction

Lecture 7: More Arithmetic and Fun With Primes

MAT Mathematics in Today's World

MITOCW ocw f99-lec01_300k

Solutions to Macro Final 2006

Measurement and Significant Figures AP CHEMISTRY. Textbook: Chemistry by Zumdahl & Zumdahl, 9th edition, Instructor: Mrs.

O.K. But what if the chicken didn t have access to a teleporter.

Tacoma Narrows Bridge

Can Everettian Interpretation Survive Continuous Spectrum?

Uncertainty and Robustness for SISO Systems

Last Update: March 1 2, 201 0

Decision Theory: Q-Learning

HOW TO WRITE PROOFS. Dr. Min Ru, University of Houston

MAS221 Analysis Semester Chapter 2 problems

DIFFERENTIAL EQUATIONS

, 500, 250, 125, , 2, 4, 7, 11, 16, , 3, 9, 27, , 3, 2, 7, , 2 2, 4, 4 2, 8

ECO 317 Economics of Uncertainty. Lectures: Tu-Th , Avinash Dixit. Precept: Fri , Andrei Rachkov. All in Fisher Hall B-01

Cycles Research Institute Definitions and Concepts Used in Cycle Study

ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process

Notes for Class Meeting 19: Uncertainty

LECTURE 1. Logic and Proofs

Math 131, Lecture 20: The Chain Rule, continued

This process was named creative destruction by Joseph Schumpeter.

Important Properties of R

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

8. Reductio ad absurdum

Testing Series With Mixed Terms

Iterative solvers for linear equations

Lecture 4 An Introduction to Stochastic Processes

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Lesson 3-1: Solving Linear Systems by Graphing

5 Major Areas of Chemistry

Sampling distributions and the Central Limit. Theorem. 17 October 2016

Uncertainty in numbers

Intermediate Logic. Natural Deduction for TFL

Discrete Structures for Computer Science

Econometrics III: Problem Set # 2 Single Agent Dynamic Discrete Choice

Transition Density Function and Partial Di erential Equations

THE SIMPLE PROOF OF GOLDBACH'S CONJECTURE. by Miles Mathis

Computability Crib Sheet

Reasoning Under Uncertainty: Introduction to Probability

What Is Classical Physics?

Lecture 6: Recursive Preferences

Math 31 Lesson Plan. Day 16: Review; Start Section 8. Elizabeth Gillaspy. October 18, Supplies needed: homework. Colored chalk. Quizzes!

Fixed Point Theorems

Fundamentals of Probability CE 311S

* 8 Groups, with Appendix containing Rings and Fields.

Basic notions of probability theory

1. Algebraic and geometric treatments Consider an LP problem in the standard form. x 0. Solutions to the system of linear equations

8. Reductio ad absurdum

Solving with Absolute Value

Probability Exercises. Problem 1.

Dynamic merge of discrete goods flow Impact on throughput and efficiency

Questions Q1. * A circuit is set up as shown in the diagram. The battery has negligible internal resistance.

Notes 07 largely plagiarized by %khc

Transcription:

Lecture: Conditional Expectation Lutz Kruschwitz & Andreas Löffler Discounted Cash Flow, Section 1.2,

Outline 1.2 Conditional expectation 1.2.1 Uncertainty and information 1.2.2 Rules 1.2.3 Application of the rules,

Uncertainty 1 Uncertainty is a distinguished feature of valuation usually modelled as different future states of nature ω with corresponding cash flows FCF t (ω). But: to the best of our knowledge particular states of nature play no role in the valuation equations [ ] of firms, instead one uses expectations E FCF t of cash flows. 1.2 Conditional expectation, 1.2.1 Uncertainty and information

Information 2 Today is certain, the future is uncertain. Now: we always stay at time 0! And think about the future Simon Vouet: Fortune teller (1617) FCF s 0 t s today future later future 1.2 Conditional expectation, 1.2.1 Uncertainty and information

A finite example 3 193.6 132 110 96.8 There are three points in time in the future. 90 110 88 145.2 48.4 Different cash flow realizations can be observed. The movements up and down along the path occur with probability 0.5. t = 0 t = 1 t = 2 t = 3 time 1.2 Conditional expectation, 1.2.1 Uncertainty and information

Actual and possible cash flow 4 What happens if actual cash flow at time t = 1 is neither 90 nor 110 (for example, 100)? Our model proved to be wrong... Nostradamus (1503 1566), failed fortune-teller 1.2 Conditional expectation, 1.2.1 Uncertainty and information

Expectations 5 Let us think about cash flow paid at time t = 3, i.e. FCF 3. What will its expectation be tomorrow? A.N. Kolmogorov (1903 1987), This depends on the state we will have tomorrow. Two cases are possible: FCF 1 = 110 or FCF 1 = 90. founded theory of conditional expectation 1.2 Conditional expectation, 1.2.1 Uncertainty and information

Thinking about the future today 6 Case 1 ( FCF 1 = 110) = Expectation of FCF 3 = 1 4 193.6+2 4 96.8+1 145.2 = 133.1. 4 Case 2 ( FCF 1 = 90) = Expectation of FCF 3 = 1 4 96.8+2 4 145.2+1 48.4 = 108.9. 4 Hence, expectation of FCF 3 is [ ] E FCF 3 F 1 = { 133.1 if the development at t = 1 is up, 108.9 if the development at t = 1 is down. 1.2 Conditional expectation, 1.2.1 Uncertainty and information

Conditional expectation 7 The expectation of FCF 3 depends on the state of nature at time t = 1. Hence, the expectation is conditional: conditional on the information at time t = 1 (abbreviated as F 1 ). A conditional expectation covers our ideas about future thoughts. This conditional expectation can be uncertain. 1.2 Conditional expectation, 1.2.1 Uncertainty and information

Rules 8 How to use conditional expectations? We will not present proofs, but only rules for calculation. Arithmetic textbook of The first three rules will be well-known from classical expectations, two will be new. Adam Ries (1492 1559) 1.2 Conditional expectation, 1.2.2 Rules

Rule 1: Classical expectation 9 ] ] E [ X F0 = E [ X At t = 0 conditional expectation and classical expectation coincide. Or: conditional expectation generalizes classical expectation. 1.2 Conditional expectation, 1.2.2 Rules

Rule 2: Linearity 10 [ E a X ] ] ] + bỹ F t = a E [ X Ft + b E [Ỹ Ft Business as usual... 1.2 Conditional expectation, 1.2.2 Rules

Rule 3: Certain quantity 11 E [1 F t ] = 1 Safety first... From this and linearity for certain quantities X, E [X F t ] = E [X 1 F t ] = X E [1 F t ] = X 1.2 Conditional expectation, 1.2.2 Rules

Rule 4: Iterated expectation 12 Let s t then [ ] ] ] E E [ X Ft F s = E [ X Fs When we think today about what we will know tomorrow about the day after tomorrow, we will only know what we today already believe to know tomorrow. 1.2 Conditional expectation, 1.2.2 Rules

Rule 5: Known or realized quantities 13 If X is known at time t ] E [ X Ỹ F t = X ] E [Ỹ Ft We can take out from the expectation what is known. Or: known quantities are like certain quantities. 1.2 Conditional expectation, 1.2.2 Rules

Using the rules 14 We want to check our rules by looking at the finite example and an infinite example. We start with the finite example: Remember that we had From this we get [ ] E FCF 3 F 1 = { 133.1 if up at time t = 1, 108.9 if down at time t = 1. [ [ ]] E E FCF 3 F 1 = 1 2 133.1 + 1 108.9 = 121. 2 1.2 Conditional expectation, 1.2.3 Application of the rules

Finite example 15 And indeed [ [ ]] E E FCF 3 F 1 [ [ ] ] = E E FCF 3 F 1 F 0 [ ] = E FCF 3 F 0 [ ] = E FCF 3 = 121! by rule 1 by rule 4 by rule 1 It seems purely by chance that [ ] E FCF 3 F 1 = 1.1 3 1 FCF 1, but it is on purpose! This will become clear later... 1.2 Conditional expectation, 1.2.3 Application of the rules

Infinite example 16 u 2g FCF t gfcf t u g FCF t ud g FCF t Again two factors up and down with probability p u and p d and 0 < d < u d g FCF t or d 2g FCF t gfcf t+1 =( ug FCF t up, dg FCF t down. t t+1 t+2 time 1.2 Conditional expectation, 1.2.3 Application of the rules

Infinite example 17 Let us evaluate the conditional expectation [ ] E FCF t+1 F t = p u u FCF t + p d d FCF t where g is the expected growth rate. = (p u u + p d d) FCF }{{} t, :=1+g If g = 0 it is said that the cash flows form a martingal. In the infinite example we will later assume no growth (g = 0). 1.2 Conditional expectation, 1.2.3 Application of the rules

Infinite example 18 Compare this if using only the rules [ [ ]] E E FCF t F s [ [ ] ] = E E FCF t F t 1 F s = E [(1 + g) FCF ] t 1 F s [ ] = (1 + g) E FCF t 1 F s by rule 4 see above by rule 2 = (1 + g) t s FCF s repeating argument. 1.2 Conditional expectation, 1.2.3 Application of the rules

Summary 19 We always stay in the present. Conditional expectation handles our knowledge of the future. Five rules cover the necessary mathematics. 1.2 Conditional expectation, 1.2.3 Application of the rules