Approximation of Continuous-State Scenario Processes in Multi-Stage Stochastic Optimization and its Applications
|
|
- Bernadette Burke
- 6 years ago
- Views:
Transcription
1 Approximation of Continuous-State Scenario Processes in Multi-Stage Stochastic Optimization and its Applications Anna Timonina University of Vienna, Abraham Wald PhD Program in Statistics and Operations Research. Supervisor Prof. Georg Pflug International Institute for Applied Systems Analysis (IIASA), Risk, Policy and Vulnerability Program Anna Timonina (Uni Wien) Stochastic Approximation 1 / 44
2 Initial Problem Description max{a[h(x, ξ); F] : x F, x X}, x A(, ) is a multi-period acceptability functional (E, AV@R...); H(x, ξ) is the (intermediate) loss/profit function; ξ = (ξ 1,..., ξ T ) is a stochastic process on (Ω, F = (F 1,..., F T ), P), where F is a filtration. x = (x 0,..., x T 1 ) are the decision functions; x F is a non-anticipativity condition (means that x t is measurable w.r.t. F t for all t). That is a variational problem that could be solved only in very special cases. Anna Timonina (Uni Wien) Stochastic Approximation 2 / 44
3 Problem Approximation max{a[h(x, ξ); F] : x F, x X}, x How to solve this problem though in general it is unsolvable? We approximate this problem by a simpler one: max{a[h( x, ξ); F] : x F, x X}, x that is a tree structured problem of huge but finite dimension, where Ω is a finite probability space; F is a finite filtration; x is a high dimensional vector. Anna Timonina (Uni Wien) Stochastic Approximation 3 / 44
4 From data to tree models modeling approx data parameter scenario estimation process scenario tree Example Energy demand, that can be described by, for example, by SARIMA or GARCH models, can be represented in terms of the scenario tree as soon as the parameters of the model are estimated and the approximation is done. For example, GARCH model with ɛ t = σ t z t ξ t = µ + β 1 ξ t 1 + ɛ t, where σ 2 t = κ + γ 1 σ 2 t γ nσ 2 t n + α 1 ɛ 2 t α mɛ 2 t m. Anna Timonina (Uni Wien) Stochastic Approximation 4 / 44
5 Filtration as a tree ξ = (ξ 1,..., ξ T ) a stochastic process defined on (Ω, F, P); ξ = ( ξ 1,..., ξ T ) a finite valued scenario process defined on ( Ω, F, P). It is not natural to construct approximations on the same probability space, because concrete decision problems are given without reference on a probability space, they are given in distributional setups. As the stochastic process ξ is given by its continuous probability distribution only, we need to approximate this distribution by discrete one, i.e. to generate points from this distribution. Hence, our aim is 1 To generate points from the given distribution (using different quantization algorithms); 2 To solve the multi-stage stochastic optimization program using the generated points. For these purposes we represent stochastic process ξ = ( ξ 1,..., ξ T ) as a finitely valued tree. Anna Timonina (Uni Wien) Stochastic Approximation 5 / 44
6 Sample tree Figure: High bushiness v.s. Low bushiness Definition Consider a finitely valued stochastic process ξ = ( ξ 1,..., ξ T ) that is represented by the tree with the same number of successors b t for each node at the stage t, t = 1,..., T. The vector bush = (b 1,..., b T ) is a bushiness vector of the tree. Anna Timonina (Uni Wien) Stochastic Approximation 6 / 44
7 Kantorovich distance between measures Definition The Kantorovich distance between measures is defined as d KA (P, P) = inf { d(w, w)π[dw, d w]}, π Ω Ω π[ Ω] = P( ), π[ω ] = P( ). Wasserstein distance: d WAr (P, P) = inf π { Ω Ω d(w, w)r π[dw, d w]} 1 r under the same constraints. Anna Timonina (Uni Wien) Stochastic Approximation 7 / 44
8 Nested distance between trees Definition The multistage distance (see [1, 2]) of two process-and-information structures is dl r (P, P) = inf ( d(w, w) r π(dw, d w)) 1 r, π dl 1 (P, P) := dl(p, P), where P, P are nested distributions (containing information about filtration structure, values and probabilities) π[a Ω F t F t ](w, w) = P(A F t )(w), (A F T, 1 t T ), π[ω B F t F t ](w, w) = P(B F t )( w), (B F T, 1 t T ). Anna Timonina (Uni Wien) Stochastic Approximation 8 / 44
9 Recursive Structure of the Nested Distance Distance between leaves of the tree (t = T ): The nested distance between last stages of tree models P and P conditional on nodes n T 1 and ñ T 1 is equal to the Kantorovich distance, i.e. dl(p T :T n T 1, P T :T ñ T 1 ) = d KA (P T ( n T 1 ), P T ( ñ T 1 )). Nested distance between subtrees ( t = 2,..., T 1): For each stage t = 2,..., T 1, the nested distance dl(p t:t n t 1, P t:t ñ t 1 ) can be received as the solution of the linear program (0.3) with the distance matrix d nt,ñ t = d(n t, ñ t ) + dl(p t+1:t nt, P t+1:t ñt ), given that the distance dl(p t+1:t nt, P t+1:t ñt) is calculated at the previous step. Resulting nested distance (t = 1): The resulting nested distance is implied by the previous step for the case t = 1. Anna Timonina (Uni Wien) Stochastic Approximation 9 / 44
10 Nested distance approximation The fundamental result of [2] says that v(p) v( P) L β dl(p, P). According to the triangle inequality that holds for the nested distance, we can write dl(p, P) dl(p, P) + dl(p, P ). In order to approximate the distance d(p, P) between stochastic process and tree P by the distance d( P, P ) between tree P and the process approximation (tree P ) we should guarantee that the distance between stochastic process ξ and its approximation (tree P ) is small enough: dl(p, P ) ε. We can guarantee it if we are increasing the bushiness of the tree P, because in this case dl(p, P ) 0 and dl(p, P) dl(p, P). Anna Timonina (Uni Wien) Stochastic Approximation 10 / 44
11 Initial Lower Bound Theorem (Lower Bound (initial), see [2]) Let P and P be two nested distributions and let P and P be the pertaining multivariate distributions respectively. Then d WAr (P, P) dl r (P, P), where d WAr (P, P) is the Wasserstein distance of order r. Anna Timonina (Uni Wien) Stochastic Approximation 11 / 44
12 Initial Upper Bound Theorem (Upper Bound (initial), see [2]) Let P be a nested distribution, P its multivariate distribution, which is dissected into the chain P = P 1 P 2... P T of conditional distributions. If t = 1,..., T the Lipschitz property holds, i.e. d KA (P t ( u), P t ( v)) K t d(u, v), then d KA (P, P) dl(p, P) T d KA (P t, P T t ) (K s + 1). t=1 s=t+1 Anna Timonina (Uni Wien) Stochastic Approximation 12 / 44
13 Stage-wise optimal quantization Optimal quantization means: 1 to find optimal supporting points z i, i = 1,..., N (z 1 z 2... z N ): min z=(z 1,...,z N ) min d(x, z s ) r dp(x) s 2 given the supporting points z i, to find the probabilities p i, such that d KA (P, P) min. Anna Timonina (Uni Wien) Stochastic Approximation 13 / 44
14 Stage-wise optimal quantization on a treestructure The stage-wise optimal tree approximation of the stochastic process ξ = (ξ 1,..., ξ T ) solves the minimization problem dl(p, P) T d KA (P t, P t ) t=1 T s=t+1 (K s + 1) min 1 First stage of the tree has N 1 nodes. We generate N 1 values of ξ 1 according to the unconditional probability distribution of ξ 1 ; 2 For each of the following stages t = 2,..., T we generate ξ t according to the conditional distribution of ξ t given the historical values of the random variables ξ t 1. Anna Timonina (Uni Wien) Stochastic Approximation 14 / 44
15 New results Anna Timonina (Uni Wien) Stochastic Approximation 15 / 44
16 Is there any chance to improve? Yes, it can and the minimal upper bound DOES NOT mean that the nested distance is minimal: a. b. Figure: Behavior of the nested distance between stochastic process and a tree. Anna Timonina (Uni Wien) Stochastic Approximation 16 / 44
17 Clairvoyant tree structure Structure of the initial tree Structure of the clairvoyant tree Stage of the tree Stage of the tree Figure: From primal to the clairvoyant tree. Anna Timonina (Uni Wien) Stochastic Approximation 17 / 44
18 From primal to the clairvoyant tree Definition (Clairvoyant tree) Tree model P c is called clairvoyant at/from stage t and denoted by P c(t) if every node n N s, s = t + 1,..., T 1 has unique successor with probability 1 (N s is the set of all node indexes at the stage s) (see Fig. 3). Out of the tree P, it is possible to receive another tree P c(t) by changing the tree structure of P so, that it becomes clairvoyant starting from the stage t. P(ξ 1, ξ 2,..., ξ T ) = P(ξ 1 ) P(ξ 2 ξ 1 )... P(ξ T ξ 1,..., ξ T 1 ), P(ξ 1, ξ 2,..., ξ T ) = P(ξ 1 ) P(ξ 2 ξ 1 )... P c(t) (ξ t,..., ξ T ξ t 1,..., ξ 1 ). Notice, that here we used the fact that the multivariate probability P(ξ 1, ξ 2,..., ξ T ) is the same for the initial and the clairvoyant trees, as well as the conditional probabilities up to time t 1. Anna Timonina (Uni Wien) Stochastic Approximation 18 / 44
19 Improved Lower Bound Theorem (Lower Bound (new)) Let P and P be two nested distributions with corresponding multivariate distributions P and P and suppose that clairvoyant nested distributions P c(t) and P c(t) are defined respectively t = 1,..., T. Then the following chain of lower bounds for the nested distance between P and P holds: d KA (P, P) = dl(p c(1), P c(1) ))... dl(p c(t), P c(t) ) dl(p c(t 1), P c(t 1) ) dl(p c(t ), P c(t ) ) = dl(p, P). Anna Timonina (Uni Wien) Stochastic Approximation 19 / 44
20 Counterexample: what if to change only one of the trees to clairvoyant? (see MatLab example) Anna Timonina (Uni Wien) Stochastic Approximation 20 / 44
21 Improved Upper Bound Theorem (Improved Upper Bound (new)) Let P and P be two nested distributions with corresponding multivariate distributions P and P dissected into the chain of conditional probabilities P = P 1 P 2... P T and P = P 1 P 2... P T. Then, dl(p, P) T sup d KA (P t t+1:t ( u t 1 ), P t t+1:t ( v t 1 )), u t 1,v t 1 t=1 where P t t+1:t ( u t 1 ) and P t t+1:t ( u t 1 ) are conditional multivariate distributions sitting at the stage t of clairvoyant trees P c(t) and P c(t). Moreover, if t = 1,..., T the Lipschitz property holds, then dl(p, P) T d KA (P t t+1:t, P t t+1:t ) t=1 T s=t+1 (K s s+1:t + 1). Anna Timonina (Uni Wien) Stochastic Approximation 21 / 44
22 Backtracking Optimal Quantization dl(p, P) T d KA (P t t+1:t, P t t+1:t ) t=1 1 FORWARD: using the stage-wise optimal quantization algorithm we receive the first approximation of the quantizers for the stages t = 1,..., T ; 2 BACKWARD: starting with the stage T 1 we adapt all the quantizers of the stages t = 1,..., T 1 so, that the Kantorovich distance between the joint probability distribution of P t:t and its discrete approximation is minimized. T s=t+1 (K s s+1:t + 1) min. Anna Timonina (Uni Wien) Stochastic Approximation 22 / 44
23 Backtracking Optimal Quantization In order to adapt the quantizers ξ t of the stage t to the possible future scenarios t + 1 : T we generate N random points x t:t and for each of them we move the closest quantizer towards it keeping the future quantizers ξ t+1,..., ξ T at the given level. Anna Timonina (Uni Wien) Stochastic Approximation 23 / 44
24 Example: Joint Adaptation Figure: Joint Adaptation Algorithm. Anna Timonina (Uni Wien) Stochastic Approximation 24 / 44
25 Is there an improvement? Yes, there is: Figure: Improvement due to the Backtracking Optimal Quantization. Anna Timonina (Uni Wien) Stochastic Approximation 25 / 44
26 MatLab examples: does the tree improve? Anna Timonina (Uni Wien) Stochastic Approximation 26 / 44
27 Example: Backtracking Optimal Quantization (random) 1 dl(tree, lp)= dl(tree imp., lp)= Tree 1 Tree improved Values on the nodes Values on the nodes Stage of the tree Stage of the tree Figure: Decrease in the nested distance due to the improvement in random quantizers. Anna Timonina (Uni Wien) Stochastic Approximation 27 / 44
28 Example: Backtracking Optimal Quantization (optimal) 1.2 dl(tree, lp)= dl(tree imp., lp)= Tree 1.2 Tree improved Values on the nodes Values on the nodes Stage of the tree Stage of the tree Figure: Decrease in the nested distance due to the improvement in stage-wise optimal quantizers. Anna Timonina (Uni Wien) Stochastic Approximation 28 / 44
29 Applications Anna Timonina (Uni Wien) Stochastic Approximation 29 / 44
30 Applications Real life: 1 Energy, finance; 2 Risk-management of catastrophic events: scenario generation based on the historical probability loss disribution; Virtual life: 1 Networks, Internet: PageRank problem of Google in the multi-stage environment. Anna Timonina (Uni Wien) Stochastic Approximation 30 / 44
31 Inventory Control Problem Anna Timonina (Uni Wien) Stochastic Approximation 31 / 44
32 Example: inventory control problem The grocery shop has to place regular orders one period ahead. ξ 1,..., ξ T is the demand for goods of the shop at times t = 1,..., T ; x t 1, t = 1,..., T is an order of goods one period ahead; 1 l t is a storage loss; rapid orders are possible for a price of u t > 1 per piece; The selling price is s t (s t > 1) and the final inventory K T has a value l T K T. T E[ (s t ξ t x t 1 u t M t ) + l T K T ] max x t=1 subject to x t F t, t = 1,..., T, l t 1 K t 1 + x t 1 ξ t = K t M t. K t 0, M t 0. Anna Timonina (Uni Wien) Stochastic Approximation 32 / 44
33 Inventory Control Problem If we consider the demand ξ lnn (µ, C), we are able to calculate the exact analytical solution (violet color in the figure): Figure: Inventory Control Problem. Anna Timonina (Uni Wien) Stochastic Approximation 33 / 44
34 Natural Disasters Risk-Management (IIASA) Anna Timonina (Uni Wien) Stochastic Approximation 34 / 44
35 Fundamentals Governments of countries with high risk of natural hazard and low risk capital are to decide how much to spend for protection of the catastrophic event and how much for recovery after it. Multi-period approach arises because of the uncertainty about the recurrence of the catastrophic event and the risk of zero risk capital at this point. Multi-hazard approach appears as there might be the dependence of one catastrophic event on another, i.e. one catastrophic event occurs as a result of another with some probability. Anna Timonina (Uni Wien) Stochastic Approximation 35 / 44
36 Multi-period approach Multi-stage stochastic programs are the standard and well-established tool to support decision making under uncertainty. The goal is 1 To construct the multi-stage decision model for adaptation and mitigation of natural hazard events; 2 To specify loss distributions for natural hazard events (type and parameters); 3 To approximate these distributions by discrete ones; 4 To construct a surrogate finite dimensional problem which is accessible to computer solution; 5 To solve the surrogate problem and to study the quality of approximation and to infer policy implications. Anna Timonina (Uni Wien) Stochastic Approximation 36 / 44
37 Risk-management of CAT-events Anna Timonina (Uni Wien) Stochastic Approximation 37 / 44
38 Problem description D 0 z k,0 ξ k,1, D 1 z k,t 1 ξ k,t, D t z T 1 ξ k,t S 0 x 0 x 1 x S 1... t 1 x t x S t... T 1 S T z k,0, C 0 z k,1, C 1, D 0 i 0 z k,t, C t, j D ji j C T, j D j Risk-neutral: (1 α) T ρ t E(c t ) + αe(s T ) t=1 max d t,c t,z t,x t Risk-averse: (1 α) T ρ t E(u(c t )) + αe(u(s T )) max, with u(x) = x γ 1 d t,c t,z t,x t γ t=1 Anna Timonina (Uni Wien) Stochastic Approximation 38 / 44
39 Types of loss distributions Pareto Heavy-tail distribution (that allows large deviation of losses) corresponds to the situation when natural hazard can be of different power. Lognormal This type of loss distribution corresponds nicely to the situation when the variable represents the compound loss from a sequence of many natural hazard events. Anna Timonina (Uni Wien) Stochastic Approximation 39 / 44
40 Generating v.s. Quantization Suppose that the distribution of the random variable ξ that describes losses in case of natural hazard is known. Then we can generate losses and their probabilities by Monte-Carlo random sampling; Choice of scenarios by optimal discretization; and see how the optimal value and optimal decision change when we increase number of possible scenarios. Anna Timonina (Uni Wien) Stochastic Approximation 40 / 44
41 CAT optimal solution Figure: Stage-wise optimal quantization v.s. random generation a. Anna Timonina (Uni Wien) Stochastic Approximation 41 / 44
42 CAT-decisions Figure: Mongolia and Mexico optimal strategy for 3 years a. Anna Timonina (Uni Wien) Stochastic Approximation 42 / 44
43 Thank you for your attention! Anna Timonina (Uni Wien) Stochastic Approximation 43 / 44
44 G. Ch. Pflug, A. Pichler. A distance for multi-stage stochastic optimization models. SIAM Journal on Optimization 22, pp. 1-23, G. Ch. Pflug, A. Pichler. Approximations for probability distributions and stochastic optimization problems. Int. Series in OR and Management Science 163, Chapter 15, pp , G. Ch. Pflug, W. Römisch. Modeling, Measuring and Managing Risk. 301 pages, World Scientific Publishing, ISBN W. Römisch. Scenario generation. Wiley Encyclopedia of Operations Research and Management Science (J.J. Cochran ed.), Wiley, A.V. Timonina. Multi-stage Stochastic Optimization: the Distance between Stochastic Scenario Processes. Springer-Verlag Berlin Heidelberg, DOI /s Anna Timonina (Uni Wien) Stochastic Approximation 44 / 44
Stochastic Dynamic Programming Using Optimal Quantizers
Annals of Operations Research 0 (2017)?? 1 Stochastic Dynamic Programming Using Optimal Quantizers Anna Timonina-Farkas École Polytechnique Fédérale de Lausanne, Risk, Analytics and Optimization Chair
More informationApproximations of Stochastic Programs. Scenario Tree Reduction and Construction
Approximations of Stochastic Programs. Scenario Tree Reduction and Construction W. Römisch Humboldt-University Berlin Institute of Mathematics 10099 Berlin, Germany www.mathematik.hu-berlin.de/~romisch
More informationEnergy Systems under Uncertainty: Modeling and Computations
Energy Systems under Uncertainty: Modeling and Computations W. Römisch Humboldt-University Berlin Department of Mathematics www.math.hu-berlin.de/~romisch Systems Analysis 2015, November 11 13, IIASA (Laxenburg,
More informationScenario reduction and scenario tree construction for power management problems
Scenario reduction and scenario tree construction for power management problems N. Gröwe-Kuska, H. Heitsch and W. Römisch Humboldt-University Berlin Institute of Mathematics Page 1 of 20 IEEE Bologna POWER
More informationMultistage risk-averse asset allocation with transaction costs
Multistage risk-averse asset allocation with transaction costs 1 Introduction Václav Kozmík 1 Abstract. This paper deals with asset allocation problems formulated as multistage stochastic programming models.
More informationScenario tree generation for stochastic programming models using GAMS/SCENRED
Scenario tree generation for stochastic programming models using GAMS/SCENRED Holger Heitsch 1 and Steven Dirkse 2 1 Humboldt-University Berlin, Department of Mathematics, Germany 2 GAMS Development Corp.,
More informationOn Complexity of Multistage Stochastic Programs
On Complexity of Multistage Stochastic Programs Alexander Shapiro School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205, USA e-mail: ashapiro@isye.gatech.edu
More informationDynamic Replication of Non-Maturing Assets and Liabilities
Dynamic Replication of Non-Maturing Assets and Liabilities Michael Schürle Institute for Operations Research and Computational Finance, University of St. Gallen, Bodanstr. 6, CH-9000 St. Gallen, Switzerland
More informationRisk aversion in multi-stage stochastic programming: a modeling and algorithmic perspective
Risk aversion in multi-stage stochastic programming: a modeling and algorithmic perspective Tito Homem-de-Mello School of Business Universidad Adolfo Ibañez, Santiago, Chile Joint work with Bernardo Pagnoncelli
More informationDynamic Risk Management in Electricity Portfolio Optimization via Polyhedral Risk Functionals
Dynamic Risk Management in Electricity Portfolio Optimization via Polyhedral Risk Functionals A. Eichhorn and W. Römisch Humboldt-University Berlin, Department of Mathematics, Germany http://www.math.hu-berlin.de/~romisch
More informationWorst-case-expectation approach to optimization under uncertainty
Worst-case-expectation approach to optimization under uncertainty Wajdi Tekaya Joint research with Alexander Shapiro, Murilo Pereira Soares and Joari Paulo da Costa : Cambridge Systems Associates; : Georgia
More informationA Multi-Stage Stochastic Programming Model for Managing Risk-Optimal Electricity Portfolios. Stochastic Programming and Electricity Risk Management
A Multi-Stage Stochastic Programming Model for Managing Risk-Optimal Electricity Portfolios SLIDE 1 Outline Multi-stage stochastic programming modeling Setting - Electricity portfolio management Electricity
More informationStochastic Dual Dynamic Programming Algorithm for Multistage Stochastic Programming
Stochastic Dual Dynamic Programg Algorithm for Multistage Stochastic Programg Final presentation ISyE 8813 Fall 2011 Guido Lagos Wajdi Tekaya Georgia Institute of Technology November 30, 2011 Multistage
More informationEE266 Homework 5 Solutions
EE, Spring 15-1 Professor S. Lall EE Homework 5 Solutions 1. A refined inventory model. In this problem we consider an inventory model that is more refined than the one you ve seen in the lectures. The
More informationReport for technical cooperation between Georgia Institute of Technology and ONS - Operador Nacional do Sistema Elétrico Risk Averse Approach
Report for technical cooperation between Georgia Institute of Technology and ONS - Operador Nacional do Sistema Elétrico Risk Averse Approach Alexander Shapiro and Wajdi Tekaya School of Industrial and
More informationRobust Dual Dynamic Programming
1 / 18 Robust Dual Dynamic Programming Angelos Georghiou, Angelos Tsoukalas, Wolfram Wiesemann American University of Beirut Olayan School of Business 31 May 217 2 / 18 Inspired by SDDP Stochastic optimization
More informationOptimal Security Liquidation Algorithms
Optimal Security Liquidation Algorithms Sergiy Butenko Department of Industrial Engineering, Texas A&M University, College Station, TX 77843-3131, USA Alexander Golodnikov Glushkov Institute of Cybernetics,
More informationScenario Generation for Stochastic Programming Introduction and selected methods
Michal Kaut Scenario Generation for Stochastic Programming Introduction and selected methods SINTEF Technology and Society September 2011 Scenario Generation for Stochastic Programming 1 Outline Introduction
More informationDASC: A DECOMPOSITION ALGORITHM FOR MULTISTAGE STOCHASTIC PROGRAMS WITH STRONGLY CONVEX COST FUNCTIONS
DASC: A DECOMPOSITION ALGORITHM FOR MULTISTAGE STOCHASTIC PROGRAMS WITH STRONGLY CONVEX COST FUNCTIONS Vincent Guigues School of Applied Mathematics, FGV Praia de Botafogo, Rio de Janeiro, Brazil vguigues@fgv.br
More informationDynamic Asset and Liability Management Models for Pension Systems
Dynamic Asset and Liability Management Models for Pension Systems The Comparison between Multi-period Stochastic Programming Model and Stochastic Control Model Muneki Kawaguchi and Norio Hibiki June 1,
More information"Pricing Exotic Options using Strong Convergence Properties
Fourth Oxford / Princeton Workshop on Financial Mathematics "Pricing Exotic Options using Strong Convergence Properties Klaus E. Schmitz Abe schmitz@maths.ox.ac.uk www.maths.ox.ac.uk/~schmitz Prof. Mike
More informationStochastic Dual Dynamic Programming
1 / 43 Stochastic Dual Dynamic Programming Operations Research Anthony Papavasiliou 2 / 43 Contents [ 10.4 of BL], [Pereira, 1991] 1 Recalling the Nested L-Shaped Decomposition 2 Drawbacks of Nested Decomposition
More informationThe Value of Stochastic Modeling in Two-Stage Stochastic Programs
The Value of Stochastic Modeling in Two-Stage Stochastic Programs Erick Delage, HEC Montréal Sharon Arroyo, The Boeing Cie. Yinyu Ye, Stanford University Tuesday, October 8 th, 2013 1 Delage et al. Value
More informationEC316a: Advanced Scientific Computation, Fall Discrete time, continuous state dynamic models: solution methods
EC316a: Advanced Scientific Computation, Fall 2003 Notes Section 4 Discrete time, continuous state dynamic models: solution methods We consider now solution methods for discrete time models in which decisions
More informationOptimal liquidation with market parameter shift: a forward approach
Optimal liquidation with market parameter shift: a forward approach (with S. Nadtochiy and T. Zariphopoulou) Haoran Wang Ph.D. candidate University of Texas at Austin ICERM June, 2017 Problem Setup and
More informationFinal exam solutions
EE365 Stochastic Control / MS&E251 Stochastic Decision Models Profs. S. Lall, S. Boyd June 5 6 or June 6 7, 2013 Final exam solutions This is a 24 hour take-home final. Please turn it in to one of the
More informationFinancial Giffen Goods: Examples and Counterexamples
Financial Giffen Goods: Examples and Counterexamples RolfPoulsen and Kourosh Marjani Rasmussen Abstract In the basic Markowitz and Merton models, a stock s weight in efficient portfolios goes up if its
More informationAMH4 - ADVANCED OPTION PRICING. Contents
AMH4 - ADVANCED OPTION PRICING ANDREW TULLOCH Contents 1. Theory of Option Pricing 2 2. Black-Scholes PDE Method 4 3. Martingale method 4 4. Monte Carlo methods 5 4.1. Method of antithetic variances 5
More informationFrom Discrete Time to Continuous Time Modeling
From Discrete Time to Continuous Time Modeling Prof. S. Jaimungal, Department of Statistics, University of Toronto 2004 Arrow-Debreu Securities 2004 Prof. S. Jaimungal 2 Consider a simple one-period economy
More informationOptimally Thresholded Realized Power Variations for Lévy Jump Diffusion Models
Optimally Thresholded Realized Power Variations for Lévy Jump Diffusion Models José E. Figueroa-López 1 1 Department of Statistics Purdue University University of Missouri-Kansas City Department of Mathematics
More informationLimit Theorems for the Empirical Distribution Function of Scaled Increments of Itô Semimartingales at high frequencies
Limit Theorems for the Empirical Distribution Function of Scaled Increments of Itô Semimartingales at high frequencies George Tauchen Duke University Viktor Todorov Northwestern University 2013 Motivation
More informationLECTURE NOTES 10 ARIEL M. VIALE
LECTURE NOTES 10 ARIEL M VIALE 1 Behavioral Asset Pricing 11 Prospect theory based asset pricing model Barberis, Huang, and Santos (2001) assume a Lucas pure-exchange economy with three types of assets:
More informationAn overview of some financial models using BSDE with enlarged filtrations
An overview of some financial models using BSDE with enlarged filtrations Anne EYRAUD-LOISEL Workshop : Enlargement of Filtrations and Applications to Finance and Insurance May 31st - June 4th, 2010, Jena
More informationStock Loan Valuation Under Brownian-Motion Based and Markov Chain Stock Models
Stock Loan Valuation Under Brownian-Motion Based and Markov Chain Stock Models David Prager 1 1 Associate Professor of Mathematics Anderson University (SC) Based on joint work with Professor Qing Zhang,
More informationQuantitative Risk Management
Quantitative Risk Management Asset Allocation and Risk Management Martin B. Haugh Department of Industrial Engineering and Operations Research Columbia University Outline Review of Mean-Variance Analysis
More informationEARLY EXERCISE OPTIONS: UPPER BOUNDS
EARLY EXERCISE OPTIONS: UPPER BOUNDS LEIF B.G. ANDERSEN AND MARK BROADIE Abstract. In this article, we discuss how to generate upper bounds for American or Bermudan securities by Monte Carlo methods. These
More informationMartingale Pricing Theory in Discrete-Time and Discrete-Space Models
IEOR E4707: Foundations of Financial Engineering c 206 by Martin Haugh Martingale Pricing Theory in Discrete-Time and Discrete-Space Models These notes develop the theory of martingale pricing in a discrete-time,
More informationOptimal construction of a fund of funds
Optimal construction of a fund of funds Petri Hilli, Matti Koivu and Teemu Pennanen January 28, 29 Introduction We study the problem of diversifying a given initial capital over a finite number of investment
More informationLecture 17. The model is parametrized by the time period, δt, and three fixed constant parameters, v, σ and the riskless rate r.
Lecture 7 Overture to continuous models Before rigorously deriving the acclaimed Black-Scholes pricing formula for the value of a European option, we developed a substantial body of material, in continuous
More informationMultistage Stochastic Programming
IE 495 Lecture 21 Multistage Stochastic Programming Prof. Jeff Linderoth April 16, 2003 April 16, 2002 Stochastic Programming Lecture 21 Slide 1 Outline HW Fixes Multistage Stochastic Programming Modeling
More informationOptimal Stopping for American Type Options
Optimal Stopping for Department of Mathematics Stockholm University Sweden E-mail: silvestrov@math.su.se ISI 2011, Dublin, 21-26 August 2011 Outline of communication Multivariate Modulated Markov price
More informationEFFICIENT MONTE CARLO ALGORITHM FOR PRICING BARRIER OPTIONS
Commun. Korean Math. Soc. 23 (2008), No. 2, pp. 285 294 EFFICIENT MONTE CARLO ALGORITHM FOR PRICING BARRIER OPTIONS Kyoung-Sook Moon Reprinted from the Communications of the Korean Mathematical Society
More informationExtended Libor Models and Their Calibration
Extended Libor Models and Their Calibration Denis Belomestny Weierstraß Institute Berlin Vienna, 16 November 2007 Denis Belomestny (WIAS) Extended Libor Models and Their Calibration Vienna, 16 November
More informationEuropean Contingent Claims
European Contingent Claims Seminar: Financial Modelling in Life Insurance organized by Dr. Nikolic and Dr. Meyhöfer Zhiwen Ning 13.05.2016 Zhiwen Ning European Contingent Claims 13.05.2016 1 / 23 outline
More informationPortfolio Optimization. Prof. Daniel P. Palomar
Portfolio Optimization Prof. Daniel P. Palomar The Hong Kong University of Science and Technology (HKUST) MAFS6010R- Portfolio Optimization with R MSc in Financial Mathematics Fall 2018-19, HKUST, Hong
More informationThe University of Chicago, Booth School of Business Business 41202, Spring Quarter 2012, Mr. Ruey S. Tsay. Solutions to Final Exam
The University of Chicago, Booth School of Business Business 41202, Spring Quarter 2012, Mr. Ruey S. Tsay Solutions to Final Exam Problem A: (40 points) Answer briefly the following questions. 1. Consider
More informationOptimal Investment for Worst-Case Crash Scenarios
Optimal Investment for Worst-Case Crash Scenarios A Martingale Approach Frank Thomas Seifried Department of Mathematics, University of Kaiserslautern June 23, 2010 (Bachelier 2010) Worst-Case Portfolio
More informationKing s College London
King s College London University Of London This paper is part of an examination of the College counting towards the award of a degree. Examinations are governed by the College Regulations under the authority
More informationParametric Inference and Dynamic State Recovery from Option Panels. Torben G. Andersen
Parametric Inference and Dynamic State Recovery from Option Panels Torben G. Andersen Joint work with Nicola Fusari and Viktor Todorov The Third International Conference High-Frequency Data Analysis in
More informationInvestigation of the and minimum storage energy target levels approach. Final Report
Investigation of the AV@R and minimum storage energy target levels approach Final Report First activity of the technical cooperation between Georgia Institute of Technology and ONS - Operador Nacional
More informationEquity correlations implied by index options: estimation and model uncertainty analysis
1/18 : estimation and model analysis, EDHEC Business School (joint work with Rama COT) Modeling and managing financial risks Paris, 10 13 January 2011 2/18 Outline 1 2 of multi-asset models Solution to
More informationRisk Neutral Valuation
copyright 2012 Christian Fries 1 / 51 Risk Neutral Valuation Christian Fries Version 2.2 http://www.christian-fries.de/finmath April 19-20, 2012 copyright 2012 Christian Fries 2 / 51 Outline Notation Differential
More informationAsymptotic results discrete time martingales and stochastic algorithms
Asymptotic results discrete time martingales and stochastic algorithms Bernard Bercu Bordeaux University, France IFCAM Summer School Bangalore, India, July 2015 Bernard Bercu Asymptotic results for discrete
More informationThe ruin probabilities of a multidimensional perturbed risk model
MATHEMATICAL COMMUNICATIONS 231 Math. Commun. 18(2013, 231 239 The ruin probabilities of a multidimensional perturbed risk model Tatjana Slijepčević-Manger 1, 1 Faculty of Civil Engineering, University
More informationArbitrage Conditions for Electricity Markets with Production and Storage
SWM ORCOS Arbitrage Conditions for Electricity Markets with Production and Storage Raimund Kovacevic Research Report 2018-03 March 2018 ISSN 2521-313X Operations Research and Control Systems Institute
More informationOptimal Securitization via Impulse Control
Optimal Securitization via Impulse Control Rüdiger Frey (joint work with Roland C. Seydel) Mathematisches Institut Universität Leipzig and MPI MIS Leipzig Bachelier Finance Society, June 21 (1) Optimal
More information2.1 Mathematical Basis: Risk-Neutral Pricing
Chapter Monte-Carlo Simulation.1 Mathematical Basis: Risk-Neutral Pricing Suppose that F T is the payoff at T for a European-type derivative f. Then the price at times t before T is given by f t = e r(t
More informationRobust portfolio optimization under multiperiod mean-standard deviation criterion
Robust portfolio optimization under multiperiod mean-standard deviation criterion Spiridon Penev 1 Pavel Shevchenko 2 Wei Wu 1 1 The University of New South Wales, Sydney Australia 2 Macquarie University
More informationPortfolio Management and Optimal Execution via Convex Optimization
Portfolio Management and Optimal Execution via Convex Optimization Enzo Busseti Stanford University April 9th, 2018 Problems portfolio management choose trades with optimization minimize risk, maximize
More informationModern Methods of Option Pricing
Modern Methods of Option Pricing Denis Belomestny Weierstraß Institute Berlin Motzen, 14 June 2007 Denis Belomestny (WIAS) Modern Methods of Option Pricing Motzen, 14 June 2007 1 / 30 Overview 1 Introduction
More informationOn solving multistage stochastic programs with coherent risk measures
On solving multistage stochastic programs with coherent risk measures Andy Philpott Vitor de Matos y Erlon Finardi z August 13, 2012 Abstract We consider a class of multistage stochastic linear programs
More informationLattice (Binomial Trees) Version 1.2
Lattice (Binomial Trees) Version 1. 1 Introduction This plug-in implements different binomial trees approximations for pricing contingent claims and allows Fairmat to use some of the most popular binomial
More informationOptimization Models in Financial Mathematics
Optimization Models in Financial Mathematics John R. Birge Northwestern University www.iems.northwestern.edu/~jrbirge Illinois Section MAA, April 3, 2004 1 Introduction Trends in financial mathematics
More informationKing s College London
King s College London University Of London This paper is part of an examination of the College counting towards the award of a degree. Examinations are governed by the College Regulations under the authority
More informationA Numerical Approach to the Estimation of Search Effort in a Search for a Moving Object
Proceedings of the 1. Conference on Applied Mathematics and Computation Dubrovnik, Croatia, September 13 18, 1999 pp. 129 136 A Numerical Approach to the Estimation of Search Effort in a Search for a Moving
More informationRobust Portfolio Choice and Indifference Valuation
and Indifference Valuation Mitja Stadje Dep. of Econometrics & Operations Research Tilburg University joint work with Roger Laeven July, 2012 http://alexandria.tue.nl/repository/books/733411.pdf Setting
More informationFinite Additivity in Dubins-Savage Gambling and Stochastic Games. Bill Sudderth University of Minnesota
Finite Additivity in Dubins-Savage Gambling and Stochastic Games Bill Sudderth University of Minnesota This talk is based on joint work with Lester Dubins, David Heath, Ashok Maitra, and Roger Purves.
More informationHedging with Life and General Insurance Products
Hedging with Life and General Insurance Products June 2016 2 Hedging with Life and General Insurance Products Jungmin Choi Department of Mathematics East Carolina University Abstract In this study, a hybrid
More informationMULTISTAGE PORTFOLIO OPTIMIZATION AS A STOCHASTIC OPTIMAL CONTROL PROBLEM
K Y B E R N E T I K A M A N U S C R I P T P R E V I E W MULTISTAGE PORTFOLIO OPTIMIZATION AS A STOCHASTIC OPTIMAL CONTROL PROBLEM Martin Lauko Each portfolio optimization problem is a trade off between
More informationTrinomial Tree. Set up a trinomial approximation to the geometric Brownian motion ds/s = r dt + σ dw. a
Trinomial Tree Set up a trinomial approximation to the geometric Brownian motion ds/s = r dt + σ dw. a The three stock prices at time t are S, Su, and Sd, where ud = 1. Impose the matching of mean and
More informationQuasi-Convex Stochastic Dynamic Programming
Quasi-Convex Stochastic Dynamic Programming John R. Birge University of Chicago Booth School of Business JRBirge SIAM FM12, MSP, 10 July 2012 1 General Theme Many dynamic optimization problems dealing
More informationForecast Horizons for Production Planning with Stochastic Demand
Forecast Horizons for Production Planning with Stochastic Demand Alfredo Garcia and Robert L. Smith Department of Industrial and Operations Engineering Universityof Michigan, Ann Arbor MI 48109 December
More informationIntroduction to Probability Theory and Stochastic Processes for Finance Lecture Notes
Introduction to Probability Theory and Stochastic Processes for Finance Lecture Notes Fabio Trojani Department of Economics, University of St. Gallen, Switzerland Correspondence address: Fabio Trojani,
More informationIEOR E4703: Monte-Carlo Simulation
IEOR E4703: Monte-Carlo Simulation Other Miscellaneous Topics and Applications of Monte-Carlo Martin Haugh Department of Industrial Engineering and Operations Research Columbia University Email: martin.b.haugh@gmail.com
More informationChapter 2 Uncertainty Analysis and Sampling Techniques
Chapter 2 Uncertainty Analysis and Sampling Techniques The probabilistic or stochastic modeling (Fig. 2.) iterative loop in the stochastic optimization procedure (Fig..4 in Chap. ) involves:. Specifying
More informationOvernight Index Rate: Model, calibration and simulation
Research Article Overnight Index Rate: Model, calibration and simulation Olga Yashkir and Yuri Yashkir Cogent Economics & Finance (2014), 2: 936955 Page 1 of 11 Research Article Overnight Index Rate: Model,
More informationD I S C O N T I N U O U S DEMAND FUNCTIONS: ESTIMATION AND PRICING. Rotterdam May 24, 2018
D I S C O N T I N U O U S DEMAND FUNCTIONS: ESTIMATION AND PRICING Arnoud V. den Boer University of Amsterdam N. Bora Keskin Duke University Rotterdam May 24, 2018 Dynamic pricing and learning: Learning
More informationSOLVING ROBUST SUPPLY CHAIN PROBLEMS
SOLVING ROBUST SUPPLY CHAIN PROBLEMS Daniel Bienstock Nuri Sercan Özbay Columbia University, New York November 13, 2005 Project with Lucent Technologies Optimize the inventory buffer levels in a complicated
More informationMULTI-STAGE STOCHASTIC ELECTRICITY PORTFOLIO OPTIMIZATION IN LIBERALIZED ENERGY MARKETS
MULTI-STAGE STOCHASTIC ELECTRICITY PORTFOLIO OPTIMIZATION IN LIBERALIZED ENERGY MARKETS R. ~ochreiter,' G. Ch. pflug,' and D. ~ozabal' Department ofstatistics and Decision Support Systems, Universizy of
More informationPolicy iterated lower bounds and linear MC upper bounds for Bermudan style derivatives
Finance Winterschool 2007, Lunteren NL Policy iterated lower bounds and linear MC upper bounds for Bermudan style derivatives Pricing complex structured products Mohrenstr 39 10117 Berlin schoenma@wias-berlin.de
More informationHomework 3: Asset Pricing
Homework 3: Asset Pricing Mohammad Hossein Rahmati November 1, 2018 1. Consider an economy with a single representative consumer who maximize E β t u(c t ) 0 < β < 1, u(c t ) = ln(c t + α) t= The sole
More informationOn the Lower Arbitrage Bound of American Contingent Claims
On the Lower Arbitrage Bound of American Contingent Claims Beatrice Acciaio Gregor Svindland December 2011 Abstract We prove that in a discrete-time market model the lower arbitrage bound of an American
More informationIEOR E4602: Quantitative Risk Management
IEOR E4602: Quantitative Risk Management Risk Measures Martin Haugh Department of Industrial Engineering and Operations Research Columbia University Email: martin.b.haugh@gmail.com Reference: Chapter 8
More informationThe Analytics of Information and Uncertainty Answers to Exercises and Excursions
The Analytics of Information and Uncertainty Answers to Exercises and Excursions Chapter 6: Information and Markets 6.1 The inter-related equilibria of prior and posterior markets Solution 6.1.1. The condition
More informationComputational Finance. Computational Finance p. 1
Computational Finance Computational Finance p. 1 Outline Binomial model: option pricing and optimal investment Monte Carlo techniques for pricing of options pricing of non-standard options improving accuracy
More informationRisk Management for Chemical Supply Chain Planning under Uncertainty
for Chemical Supply Chain Planning under Uncertainty Fengqi You and Ignacio E. Grossmann Dept. of Chemical Engineering, Carnegie Mellon University John M. Wassick The Dow Chemical Company Introduction
More informationGirsanov s Theorem. Bernardo D Auria web: July 5, 2017 ICMAT / UC3M
Girsanov s Theorem Bernardo D Auria email: bernardo.dauria@uc3m.es web: www.est.uc3m.es/bdauria July 5, 2017 ICMAT / UC3M Girsanov s Theorem Decomposition of P-Martingales as Q-semi-martingales Theorem
More informationDependence Structure and Extreme Comovements in International Equity and Bond Markets
Dependence Structure and Extreme Comovements in International Equity and Bond Markets René Garcia Edhec Business School, Université de Montréal, CIRANO and CIREQ Georges Tsafack Suffolk University Measuring
More informationAssessing Policy Quality in Multi-stage Stochastic Programming
Assessing Policy Quality in Multi-stage Stochastic Programming Anukal Chiralaksanakul and David P. Morton Graduate Program in Operations Research The University of Texas at Austin Austin, TX 78712 January
More informationHomework Assignments
Homework Assignments Week 1 (p 57) #4.1, 4., 4.3 Week (pp 58-6) #4.5, 4.6, 4.8(a), 4.13, 4.0, 4.6(b), 4.8, 4.31, 4.34 Week 3 (pp 15-19) #1.9, 1.1, 1.13, 1.15, 1.18 (pp 9-31) #.,.6,.9 Week 4 (pp 36-37)
More informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 1.1287/opre.11.864ec e-companion ONLY AVAILABLE IN ELECTRONIC FORM informs 21 INFORMS Electronic Companion Risk Analysis of Collateralized Debt Obligations by Kay Giesecke and Baeho
More informationGlobal convergence rate analysis of unconstrained optimization methods based on probabilistic models
Math. Program., Ser. A DOI 10.1007/s10107-017-1137-4 FULL LENGTH PAPER Global convergence rate analysis of unconstrained optimization methods based on probabilistic models C. Cartis 1 K. Scheinberg 2 Received:
More informationMYOPIC INVENTORY POLICIES USING INDIVIDUAL CUSTOMER ARRIVAL INFORMATION
Working Paper WP no 719 November, 2007 MYOPIC INVENTORY POLICIES USING INDIVIDUAL CUSTOMER ARRIVAL INFORMATION Víctor Martínez de Albéniz 1 Alejandro Lago 1 1 Professor, Operations Management and Technology,
More informationMACROECONOMICS. Prelim Exam
MACROECONOMICS Prelim Exam Austin, June 1, 2012 Instructions This is a closed book exam. If you get stuck in one section move to the next one. Do not waste time on sections that you find hard to solve.
More informationu (x) < 0. and if you believe in diminishing return of the wealth, then you would require
Chapter 8 Markowitz Portfolio Theory 8.7 Investor Utility Functions People are always asked the question: would more money make you happier? The answer is usually yes. The next question is how much more
More informationPakes (1986): Patents as Options: Some Estimates of the Value of Holding European Patent Stocks
Pakes (1986): Patents as Options: Some Estimates of the Value of Holding European Patent Stocks Spring 2009 Main question: How much are patents worth? Answering this question is important, because it helps
More informationVersion A. Problem 1. Let X be the continuous random variable defined by the following pdf: 1 x/2 when 0 x 2, f(x) = 0 otherwise.
Math 224 Q Exam 3A Fall 217 Tues Dec 12 Version A Problem 1. Let X be the continuous random variable defined by the following pdf: { 1 x/2 when x 2, f(x) otherwise. (a) Compute the mean µ E[X]. E[X] x
More informationOptimal investments under dynamic performance critria. Lecture IV
Optimal investments under dynamic performance critria Lecture IV 1 Utility-based measurement of performance 2 Deterministic environment Utility traits u(x, t) : x wealth and t time Monotonicity u x (x,
More informationBACHELIER FINANCE SOCIETY. 4 th World Congress Tokyo, Investments and forward utilities. Thaleia Zariphopoulou The University of Texas at Austin
BACHELIER FINANCE SOCIETY 4 th World Congress Tokyo, 26 Investments and forward utilities Thaleia Zariphopoulou The University of Texas at Austin 1 Topics Utility-based measurement of performance Utilities
More informationBasic Arbitrage Theory KTH Tomas Björk
Basic Arbitrage Theory KTH 2010 Tomas Björk Tomas Björk, 2010 Contents 1. Mathematics recap. (Ch 10-12) 2. Recap of the martingale approach. (Ch 10-12) 3. Change of numeraire. (Ch 26) Björk,T. Arbitrage
More information