Robustness and bootstrap techniques in portfolio efficiency tests

Size: px
Start display at page:

Download "Robustness and bootstrap techniques in portfolio efficiency tests"

Transcription

1 Robustness and bootstrap techniques in portfolio efficiency tests Dept. of Probability and Mathematical Statistics, Charles University, Prague, Czech Republic July 8, 2013

2 Motivation

3 Portfolio selection model Mean risk models max λ Λ m(λ ϱ) νr(λ ϱ) or min λ Λ r(λ ϱ) s.t. m(λ ϱ) µ ϱ is a random vector of assets returns maximizing mean m(λ ϱ) & minimizing risk r(λ ϱ) risk measures (variance, semi variance,...,var, CVaR) risk or return parameter (ν, µ) If we do not know the parametrs efficiency frontier

4 Portfolio selection model Utility functions approach max λ Λ Eu(λ ϱ) u is an utility function (non-decreasing function) maximizing expected utility choice of utility function - risk attitude If no information about utility function is known stochastic dominance portfolio efficiency with respect to stochastic dominance

5 Efficient portfolios Crucial question of portfolio efficiency (in the sense of optimality): Is a given portfolio a maximizer of expected utility for at least one considered utility function? Crucial question of portfolio efficiency (in the sense of admissibility): Does there exist a better portfolio (having higher expected utility) than a given portfolio for all considered investors (utility functions) If not - the portfolio is not the optimal choice for any considered investor (reduction of the set of feasible strategies).

6 Randomness in the model Known returns of investments no randomness deterministic optimization model Returns are random with known probability distributions optimization under risk Returns are random, probability distribution is not precisely known robust optimization Returns are random with no information about their probability distribution optimization under uncertainty

7 Summary We will consider: maximizing expected utility problems an utility function is not known all admissible utility functions are used returns are random with partially known probability distribution

8 Outline Introduction to stochastic dominance and portfolio efficiency Robust stochastic dominance portfolio efficiency tests 1 fixed scenario probabilities (Kopa (2010)) 2 fixed scenario values (Kopa (2012)) Robustness via contamination (Dupačová and Kopa (2012,2013)) Bootstrap techniques in portfolio efficiency testing (Post and Kopa (2013A, 2013B))

9 First order stochastic dominance (FSD) - notation Consider N assets and a random vector of their returns ϱ with distribution P. A decision maker may combine assets into portfolios and all portfolio possibilities are given by Λ = {λ R N 1 λ = 1, λ n 0, n = 1, 2,..., N}. Let F ϱ λ(x) denote the cumulative probability distribution function of returns of portfolio λ. Definition Portfolio λ Λ dominates portfolio τ Λ by the first-order stochastic dominance (ϱ λ FSD ϱ τ ) if F ϱ λ(x) F ϱ τ (x) x R with strict inequality for at least one x R.

10 First order stochastic dominance (FSD) - interpretation Other equivalent definitions: ϱ λ FSD ϱ τ if Eu(ϱ λ) Eu(ϱ τ ) for all utility functions and strict inequality holds for at least some utility function. No non-satiable decision maker prefers portfolio τ to portfolio λ and at least one prefers λ to τ. F 1 1 ϱ λ (y) Fϱ τ (y) y [0, 1] with strict inequality for at least one y [0, 1]. VaR α ( ϱ λ) VaR α ( ϱ τ ) α [0, 1] with strict inequality for at least one α [0, 1].

11 Portfolio efficiency with respect to FSD FSD efficiency: admissibility vs. optimality Definition (Admissibility case) A given portfolio τ Λ is FSD inefficient if there exists portfolio λ Λ such that ϱ λ FSD ϱ τ. Otherwise, portfolio τ is FSD efficient. Definition (Optimality case) Portfolio τ Λ is FSD efficient if it is the optimal solution of max λ Λ Eu(ϱ λ) for at least some utility function, i.e., there exists u such that Otherwise, τ is FSD non-optimal. Eu(ϱ τ ) Eu(ϱ λ) 0 λ Λ. See Kuosmanen (2004), Kopa & Post (2009). We focus on the admissibility case.

12 Portfolio efficiency test with respect to FSD In order to find a FSD dominating portfolio λ, we may solve the following problem, Dupačová and Kopa (2013): where Theorem ξ P (τ ) = min λ h P(λ, τ ) (1) s.t. H P (λ, τ ) 0 λ Λ. h P (λ, τ ) := min y R (F ϱ λ(y) F ϱ τ (y)) H P (λ, τ ) := max y R (F ϱ λ(y) F ϱ τ (y)) A given portfolio τ is FSD efficient if and only if ξ P (τ ) = 0. If ξ P (τ ) < 0 then the optimal portfolio λ in (1) is FSD efficient and it dominates portfolio τ by FSD.

13 FSD efficiency testing - practical issues So far we have assumed an arbitrary distribution P. The FSD efficiency test: can be rewritten as: How to solve the problem? ξ P (τ ) = min λ h P(λ, τ ) (2) s.t. H P (λ, τ ) 0 λ Λ. ξ P (τ ) = min λ h P(λ, τ ) (3) s.t. F ϱ λ(y) F ϱ τ (y) 0 y R (4) λ Λ. To assume a specific distribution (normal,elliptical) and rewrite (4) in a few constraints To assume a scenario approach, i.e. P is a discrete probability distribution, and again rewrite (4) in finitely many constraints.

14 FSD efficiency testing - scenario approach From now on, we assume that ϱ takes S values r s = (r1 s, r 2 s,..., r N s ), called scenarios, with probabilities p 1, p 2,..., p S. Contrary to the former tests, Kuosmanen (2004), Kopa & Post (2009), we do NOT assume equiprobable scenarios. The scenarios are collected in the matrix R = For any portfolio λ Λ, let ( Rλ) [k] be the k-th greatest element of ( Rλ), i.e. ( Rλ) [1] ( Rλ) [2]... ( Rλ) [S] and let I (λ) be a permutation of the index set I = {1, 2,..., S} such that r i(λ) λ = ( Rλ) [i]. Accordingly, we can order the corresponding probabilities and we denote pi λ = p i(λ). Hence, r 1 r 2. r S p λ i = P( ϱλ = ( Rλ) [i] ). Moreover, we consider cumulative probabilities: qs λ = s i=1 pλ i. The same notation is applied for the tested portfolio τ = (τ 1, τ 2,..., τ N ).

15 FSD efficiency testing - scenario approach, Dupačová and Kopa (2013) Following quantile approach to FSD the inequality of VaRs: VaR α (ϱ λ) VaR α (ϱ τ ) need not be verified in all α (0, 1], but only in at most S particular points: Theorem A portfolio λ dominates portfolio τ with respect to FSD (ϱ λ FSD ϱ τ ) if and only if VaR q τ s ( ϱ λ) VaR q τ s ( ϱ τ ) for all s = 1, 2,..., S with strict inequality for at least one q τ s. A similar result can be shown in terms of cumulative distribution functions instead of VaRs.

16 FSD efficiency testing - scenario approach Consider the following measure: ξ(τ, R, p) = min b s,λ b s (5) s=1 s.t. VaR q τ s ( ϱ λ) VaR q τ s ( ϱ τ ) b s, s = 1,..., S b s 0, λ Λ. s = 1,..., S The objective function of (5) represents the sum of differences between VaRs of a portfolio λ and VaRs of the tested portfolio τ. The differences are considered in points qs τ s = 1,..., S and must be nonpositive. The other points need not be taken into account, because VaR α is a piecewise constant function of α. Theorem A given portfolio τ is FSD efficient if and only if ξ(τ, R, p) = 0. If ξ(τ, R, p) < 0 then the optimal portfolio λ in (5) is FSD efficient and it dominates portfolio τ by FSD.

17 FSD efficiency - neighborhood robustness-fixed scenario values, Dupačová and Kopa (2013) Another approach to robustness: ɛ-fsd efficiency test. Assume that the probability distribution P of random returns ϱ takes again values r s, s = 1, 2,..., S but with other probabilities p = ( p 1, p 2,..., p S ). We define the distance between P and P as d( P, P) = max i p i p i. Definition A given portfolio τ Λ is ɛ-fsd inefficient if there exists portfolio λ Λ and P such that d( P, P) ɛ with ϱ λ FSD ϱ τ. Otherwise, portfolio τ is ɛ-fsd efficient. The introduced ɛ-fsd efficiency guarantees stability of the FSD efficiency classification with respect to small changes (prescribed by parameter ɛ) in probability vector p. A given portfolio τ is ɛ-fsd efficient if and only if no portfolio λ FSD dominates τ neither for the original probabilities p nor for arbitrary probabilities p from ɛ-neighborhood of the original vector p. Also stability with respect to changes in values of scenarios r s (fixed probabilities) can be analyzed

18 ɛ-fsd efficiency test For testing ɛ-fsd efficiency of a given portfolio τ we modify (5) in order to introduce a new measure of ɛ-fsd efficiency: ξ ɛ (τ, R, p) = min b s,λ, p, q s=1 b s (6) s.t. VaR q τ s ( ϱ λ) VaR q τ s ( ϱ τ ) b s, s = 1,..., S s q s τ = p i τ, s = 1,..., S i=1 p i = 1, ɛ p i p i ɛ, p i 0, i = 1, 2,..., S i=1 λ Λ b s 0, s = 1,..., S Theorem Portfolio τ Λ is ɛ-fsd efficient if and only if ξ ɛ (τ, R, p) given by (6) is equal to zero.

19 Second order stochastic dominance definitions Let F r λ(x) denote the cumulative probability distribution function of returns of portfolio λ. The twice cumulative probability distribution function of returns of portfolio λ is defined as F (2) r λ (y) = y F r λ(x)dx. (7) Definition Portfolio λ Λ dominates portfolio τ Λ by the second-order stochastic dominance (r λ SSD r τ ) if and only if F (2) (2) r λ (y) F r τ (y) y R with strict inequality for at least one y R. Definition A given portfolio τ Λ is SSD inefficient if there exists portfolio λ Λ such that r λ SSD r τ. Otherwise, portfolio τ is SSD efficient.

20 Second order stochastic dominance interpretation Other equivalent definitions of SSD relation: r λ SSD r τ if Eu(r λ) Eu(r τ ) for all concave utility functions and strict inequality holds for at least some concave utility function. No non-satiable and risk averse decision maker prefers portfolio τ to portfolio λ and at least one prefers λ to τ. F 2 2 r λ (y) Fr τ (y) y [0, 1] with strict inequality for at least one y [0, 1], where F 2 r λ is a cumulated quantile function. CVaR α ( r λ) CVaR α ( r τ ) α [0, 1] with strict inequality for at least one α [0, 1], where CVaR α ( r λ) = min v + 1 v R,z t R + 1 α p t z t (8) t=1 s.t. z t x t λ v, t = 1, 2,..., S

21 Portfolio efficiency testing, Dupačová and Kopa (2012) Let S 1 ξ(τ, X, p) = min a s,λ s=0 a s s.t. CVaR q λ s ( r λ) CVaR q λ s ( r τ ) a s, s = 0, 1,..., S 1 a s 0, s = 0, 1,..., S 1 λ Λ. (9) Theorem A given portfolio τ is SSD efficient if and only if ξ(τ, X, p) = 0. If ξ(τ, X, p) < 0 then the optimal portfolio λ in (9) is SSD efficient and it dominates portfolio τ by SSD.

22 Nonlinear integer SSD efficiency test Expressions for CVaR: CVaR α ( r λ) = min v + 1 v R,z t R + 1 α p t z t (10) t=1 s.t. z t x t λ v, t = 1, 2,..., S and the similar expression can be considered for portfolio τ. However, for portfolio τ, we will rather use the dual formulation: CVaR α ( r τ ) = max κ t R α κ t ( x t τ ) (11) t=1 s.t. κ t p t, t = 1, 2,..., S κ t = 1 α t=1 See Rockafellar & Uryasev (2000, 2002) for more details.

23 Nonlinear integer SSD efficiency test - cont. For each portfolio λ, we consider a permutation matrix Π = {π i,j } S i,j=1 that arranges the losses of portfolio λ in ascending order, that is, S j=1 π 1,j( x j λ) S j=1 π 2,j( x j λ)... S j=1 π S,j( x j λ) and S j=1 π s,j( x j λ) = ( X λ) [s]. Using the same permutation matrix, we can reorder also the vector of probabilities: S j=1 π s,jp j = p λ s. And cumulative probabilities are: q λ s = s i=1 S j=1 π i,jp j.

24 Nonlinear integer SSD efficiency test, Kopa (2012) ξ(τ, X, p) = 1 s.t. v s + 1 qs 1 λ min a s,v s,z s,t,κ s,t,q λ s,λ s=1 a s 1 p tz s,t 1 qs 1 λ t=1 z s,t x t λ v s, s, t = 1, 2,..., S κ s,t p t, s, t = 1, 2,..., S κ s,t = 1 qs 1, λ s = 1, 2,..., S t=1 q λ 0 = 0, q λ s = s i=1 π s,j ( x j λ) j=1 π s,j = s=1 κ s,t( x t τ ) a s, t=1 π i,j p j, s = 1, 2,..., S 1 j=1 π s+1,j ( x j λ), s = 1, 2,..., S 1 j=1 π s,j = 1, π s,j {0, 1}, j, s = 1, 2,..., S j=1 a s 0, s = 1, 2,..., S, z s,t, κ s,t 0, s, t = 1, 2,..., S λ Λ. s = 1, 2,..., S

25 Robustness in SSD portfolio efficiency testing - notation Following Dupačová & Kopa (2012), we consider ɛ-ssd efficiency approach as a robustification of the classical SSD portfolio efficiency. It guarantees stability of the SSD efficiency classification with respect to small changes (prescribed by parameter ɛ > 0) in probability vector p. Assume that the probability distribution P of random returns r takes again values x s, s = 1, 2,..., S but with other probabilities p = ( p 1, p 2,..., p S ). We define the distance between P and P as d( P, P) = max i p i p i. Definition A given portfolio τ Λ is ɛ-ssd inefficient if there exists portfolio λ Λ and P such that d( P, P) ɛ with r λ SSD r τ. Otherwise, portfolio τ is ɛ-ssd efficient. A portfolio τ is ɛ-ssd efficient if and only if no portfolio λ SSD dominates τ neither for the original probabilities p nor for arbitrary probabilities p from ɛ-neighborhood of the original vector p.

26 ɛ-ssd portfolio efficiency test ξ ɛ (τ, X, p) = 1 s.t. v s + 1 q s 1 λ min a s a s,v s,z s,t,κ s,t, p i q s λ,λ s=1 1 p t z s,t 1 q s 1 λ t=1 z s,t x t λ v s, s, t = 1, 2,..., S κ s,t p t, s, t = 1, 2,..., S κ s,t = 1 q s 1, λ s = 1, 2,..., S t=1 q λ 0 = 0, q λ s = i=1 j=1 κ s,t ( x t τ ) a s, t=1 s π i,j p j, s = 1, 2,..., S 1 s = 1, 2,..., S

27 ɛ-ssd portfolio efficiency test - cont π s,j ( x j λ) π s+1,j ( x j λ), s = 1, 2,..., S 1 j=1 j=1 π s,j = π s,j = 1, j, s = 1, 2,..., S s=1 j=1 a s 0, s = 1, 2,..., S z s,t, κ s,t 0, s, t = 1, 2,..., S π i,j {0, 1}, i, j = 1, 2,..., S λ Λ p i = 1 i=1 ɛ p i p i ɛ, i = 1, 2,..., S p i 0, i = 1, 2,..., S.

28 Robustness in SSD portfolio efficiency testing - equiprobable scenarios, Kopa (2010) We consider P containing all discrete probability distributions with S equiprobable scenarios and scenario matrix R P from the ɛ-neighbourhood of P 0, that is, satisfying d(p, P 0 ) ɛ. Let matrix Υ = {υ ij } S i,j=1 be defined as Υ = R P R. Moreover, if D(P, P 0 ) = max i,j υ ij then a robust counterpart of the Kuosmanen (2004) SSD efficiency test can be formulated as follows: min 1 a s.t. W (R + Υ)τ (R + Υ)λ a 1 W = 1, W 1 = 1 ɛ υ ij ɛ i, j = 1,..., S x X.

29 Robustness analysis via Contamination Intorduced for general stochastic programs by Dupačová et. al. (1996, 2000, ) Assume that a problem was solved for original distribution P. Changes in probability distribution P are modeled using contaminated distributions P(t) := (1 t)p + tq, t [0, 1] with Q another fixed probability distribution such that optimal value function ϕ(q) is finite. Via contamination, robustness analysis wrt. changes in P gets reduced to much simpler analysis of parametric program with scalar parameter t. One can compute lower and upper bound for optimal value function ϕ(t). We apply this notion in the easiest manner - the alternative distribution is just one scenario (can be seen as stress test scenario or worst case scenario)

30 Directional FSD portfolio efficiency with respect to an additional scenario, Dupačová and Kopa (2013) Assume continuous original distribution of returns P. Consider a contamination of the original distribution of returns by additional scenario s: P(t) = (1 t)p + tδ {s}, t [0, 1]. Let ϱ(t) be a random variable with distribution P(t). Similarly to (1) we consider: ξ P(t) (τ ) = min λ h P(t)(λ, τ ) (12) s.t. H P(t) (λ, τ ) 0 λ Λ where H P(t) (λ, τ ) = max y R (F ϱ(t) λ(y) F ϱ(t) τ (y)) and h P(t) (λ, τ ) = min y R (F ϱ(t) λ(y) F ϱ(t) τ (y))

31 Directional FSD portfolio efficiency with respect to an additional scenario - cont. A robust version of FSD efficiency: Definition A given portfolio τ Λ is directionally FSD inefficient with respect to additional scenario s if for each t exists λ(t) such that ϱ(t) λ(t) FSD ϱ(t) τ. Moreover, a given portfolio τ Λ is directionally FSD efficient with respect to additional scenario s if there is no (t, λ(t)) such that ϱ(t) λ(t) FSD ϱ(t) τ. The definition classifies portfolio τ as directionally FSD efficient (inefficient) with respect to additional scenario s if τ is FSD efficient (inefficient) when using the original distribution P as well as in any contaminated case P(t).

32 Directional FSD portfolio efficiency with respect to an additional scenario - necessary and sufficient conditions, Dupačová and Kopa (2013) Theorem A given portfolio τ Λ is directionally FSD efficient with respect to additional scenario s if and only if min ξ P(t) (τ ) = 0. t [0,1] Using (12): min ξ P(t) (τ ) = min h P(t)(λ, τ ) (13) t [0,1] λ,t s.t. H P(t) (λ, τ ) 0 λ Λ. Theorem A given portfolio τ Λ is directionally FSD inefficient with respect to additional scenario s if and only if max ξ P(t) (τ ) < 0. t [0,1] It leads to minimax...

33 Directional FSD portfolio efficiency with respect to an additional scenario - sufficient condition, Dupačová and Kopa (2013) If H P(t) (λ, τ ) is concave in t then ξ P(t) (τ ) is quasiconcave in t and ξ P(t) (τ ) min{ξ P(0) (τ ), ξ P(1) (τ )}. As a consequence we can derive the following sufficient condition for directional FSD efficiency with respect to additional scenario s. Theorem If H P(t) (λ, τ ) is concave in t. τ is FSD efficient when using original probability distribution P τ argmax λ Λ s λ then τ is directionally FSD efficient with respect to s.

34 Directional FSD portfolio inefficiency with respect to an additional scenario - sufficient condition, Dupačová and Kopa (2013) Since F ϱ(t) λ(y) is linear in t for all λ Λ and y R we may derive the following sufficient condition: Theorem If there exists λ Λ such that ϱ λ FSD ϱ τ and s λ s τ then τ is directionally FSD inefficient with respect to s. The proof makes use of an upper bound to show that λ Λ satisfying ϱ λ FSD ϱ τ and s λ s τ FSD dominates τ in any contaminated case, i.e. ϱ(t) λ FSD ϱ(t) τ.

35 Directional SSD portfolio efficiency with respect to the additional scenario, Dupačová and Kopa (2012) For a contamination parameter t [0, 1], we assume that the random return ϱ(t) takes values r 1, r 2,..., r S+1 with probabilities p(t) = ((1 t)p 1, (1 t)p 2,..., (1 t)p S, t). We denote the extended scenario matrix by R, that is, Definition R = ( R r S+1 A given portfolio τ Λ is directionally SSD inefficient with respect to r S+1 if it exists t 0 > 0 such that for every t [0, t 0 ] there is a portfolio λ(t) Λ satisfying ϱ(t) λ(t) SSD ϱ(t) τ. Definition A given portfolio τ Λ is directionally SSD efficient with respect to r S+1 if there does not exist t 0 > 0 such that for every t [0, t 0 ] there is a portfolio λ(t) Λ satisfying ϱ(t) λ(t) SSD ϱ(t) τ. ).

36 Robust portfolio efficiency con t, Dupačová and Kopa (2012) Using contamination bounds we can derive a sufficient condition for directional SSD efficiency and directional SSD inefficiency. Theorem Let τ Λ be a SSD efficient portfolio for the original distribution P. Let r S+1 τ r S+1 λ for all λ Λ. (14) Then τ Λ is directionally SSD efficient with respect to r S+1. Theorem Let τ Λ be a SSD inefficient portfolio for the original distribution P. If there exists a portfolio λ Λ such that CVaR q λ s ( ϱ λ) CVaR q λ s ( ϱ τ ) < 0, s = 0, 1,..., S 1(15) r S+1 λ min((rτ ) [1], r S+1 τ ) (16) then τ is directionally SSD inefficient with respect to r S+1.

37 Bootstrap in SD portfolio efficiency tests, Post and Kopa (2013A, 2013B) Idea: generate pseudosamples from the original distribution apply a portfolio efficiency test in each pseudosample compute the bootstrap p-value of zero hypothesis - portfolio is NSD efficient to deal with bias - Entire Distance Bootstrap Results on US stock market data: The higher order of stochastic dominance - the smaller bootstrap p-value (Post and Kopa 2013A) EDB gives better results than naive bootstrap (Post and Kopa 2013B)

38 End of the presentation Thank you for your attention.

39 Main quoted references J. Dupačová & M. Kopa (2013): Robustness of optimal portfolios under risk and stochastic dominance constraints, European Journal of Operational Research, DOI: T. Post & M. Kopa (2013A): General Linear Formulations of Stochastic Dominance Criteria, European Journal of Operational Research, 230, 2, T. Post & M. Kopa (2013B): Aggregate Investor Preferences and Beliefs: A comment, forthcomming in Journal of Empirical Finance. J. Dupačová & M. Kopa (2012): Robustness in stochastic programs with risk constraints, Annals of Operations Research 200, 1, M. Kopa (2012): Robustness in SSD portfolio efficiency testing, Proceedings of International Conference on Operations Research, pp Springer, Berlin, M. Kopa (2010): Measuring of second-order stochastic dominance portfolio efficiency, Kybernetika 46, 3, M. Kopa & T. Post (2009): A portfolio optimality test based on the first-order stochastic dominance criterion, Journal of Financial and Quantitative Analysis 44, 5,

Miloš Kopa. Decision problems with stochastic dominance constraints

Miloš Kopa. Decision problems with stochastic dominance constraints Decision problems with stochastic dominance constraints Motivation Portfolio selection model Mean risk models max λ Λ m(λ r) νr(λ r) or min λ Λ r(λ r) s.t. m(λ r) µ r is a random vector of assets returns

More information

Robustness in Stochastic Programs with Risk Constraints

Robustness in Stochastic Programs with Risk Constraints Robustness in Stochastic Programs with Risk Constraints Dept. of Probability and Mathematical Statistics, Faculty of Mathematics and Physics Charles University, Prague, Czech Republic www.karlin.mff.cuni.cz/~kopa

More information

A SECOND ORDER STOCHASTIC DOMINANCE PORTFOLIO EFFICIENCY MEASURE

A SECOND ORDER STOCHASTIC DOMINANCE PORTFOLIO EFFICIENCY MEASURE K Y B E R N E I K A V O L U M E 4 4 ( 2 0 0 8 ), N U M B E R 2, P A G E S 2 4 3 2 5 8 A SECOND ORDER SOCHASIC DOMINANCE PORFOLIO EFFICIENCY MEASURE Miloš Kopa and Petr Chovanec In this paper, we introduce

More information

Portfolio optimization with stochastic dominance constraints

Portfolio optimization with stochastic dominance constraints Charles University in Prague Faculty of Mathematics and Physics Portfolio optimization with stochastic dominance constraints December 16, 2014 Contents Motivation 1 Motivation 2 3 4 5 Contents Motivation

More information

Reformulation of chance constrained problems using penalty functions

Reformulation of chance constrained problems using penalty functions Reformulation of chance constrained problems using penalty functions Martin Branda Charles University in Prague Faculty of Mathematics and Physics EURO XXIV July 11-14, 2010, Lisbon Martin Branda (MFF

More information

ORIGINS OF STOCHASTIC PROGRAMMING

ORIGINS OF STOCHASTIC PROGRAMMING ORIGINS OF STOCHASTIC PROGRAMMING Early 1950 s: in applications of Linear Programming unknown values of coefficients: demands, technological coefficients, yields, etc. QUOTATION Dantzig, Interfaces 20,1990

More information

Włodzimierz Ogryczak. Warsaw University of Technology, ICCE ON ROBUST SOLUTIONS TO MULTI-OBJECTIVE LINEAR PROGRAMS. Introduction. Abstract.

Włodzimierz Ogryczak. Warsaw University of Technology, ICCE ON ROBUST SOLUTIONS TO MULTI-OBJECTIVE LINEAR PROGRAMS. Introduction. Abstract. Włodzimierz Ogryczak Warsaw University of Technology, ICCE ON ROBUST SOLUTIONS TO MULTI-OBJECTIVE LINEAR PROGRAMS Abstract In multiple criteria linear programming (MOLP) any efficient solution can be found

More information

Robust Optimization: Applications in Portfolio Selection Problems

Robust Optimization: Applications in Portfolio Selection Problems Robust Optimization: Applications in Portfolio Selection Problems Vris Cheung and Henry Wolkowicz WatRISQ University of Waterloo Vris Cheung (University of Waterloo) Robust optimization 2009 1 / 19 Outline

More information

Ambiguity in portfolio optimization

Ambiguity in portfolio optimization May/June 2006 Introduction: Risk and Ambiguity Frank Knight Risk, Uncertainty and Profit (1920) Risk: the decision-maker can assign mathematical probabilities to random phenomena Uncertainty: randomness

More information

Birgit Rudloff Operations Research and Financial Engineering, Princeton University

Birgit Rudloff Operations Research and Financial Engineering, Princeton University TIME CONSISTENT RISK AVERSE DYNAMIC DECISION MODELS: AN ECONOMIC INTERPRETATION Birgit Rudloff Operations Research and Financial Engineering, Princeton University brudloff@princeton.edu Alexandre Street

More information

Valid Inequalities and Restrictions for Stochastic Programming Problems with First Order Stochastic Dominance Constraints

Valid Inequalities and Restrictions for Stochastic Programming Problems with First Order Stochastic Dominance Constraints Valid Inequalities and Restrictions for Stochastic Programming Problems with First Order Stochastic Dominance Constraints Nilay Noyan Andrzej Ruszczyński March 21, 2006 Abstract Stochastic dominance relations

More information

Robust portfolio selection under norm uncertainty

Robust portfolio selection under norm uncertainty Wang and Cheng Journal of Inequalities and Applications (2016) 2016:164 DOI 10.1186/s13660-016-1102-4 R E S E A R C H Open Access Robust portfolio selection under norm uncertainty Lei Wang 1 and Xi Cheng

More information

SOME HISTORY OF STOCHASTIC PROGRAMMING

SOME HISTORY OF STOCHASTIC PROGRAMMING SOME HISTORY OF STOCHASTIC PROGRAMMING Early 1950 s: in applications of Linear Programming unknown values of coefficients: demands, technological coefficients, yields, etc. QUOTATION Dantzig, Interfaces

More information

Fundamentals in Optimal Investments. Lecture I

Fundamentals in Optimal Investments. Lecture I Fundamentals in Optimal Investments Lecture I + 1 Portfolio choice Portfolio allocations and their ordering Performance indices Fundamentals in optimal portfolio choice Expected utility theory and its

More information

Department of Economics and Management University of Brescia Italy WORKING PAPER. Discrete Conditional Value-at-Risk

Department of Economics and Management University of Brescia Italy WORKING PAPER. Discrete Conditional Value-at-Risk Department of Economics and Management University of Brescia Italy WORKING PAPER Discrete Conditional Value-at-Risk Carlo Filippi Wlodzimierz Ogryczak M. Grazia peranza WPDEM 2/2016 Via. Faustino 74/b,

More information

Testing Downside-Risk Efficiency Under Distress

Testing Downside-Risk Efficiency Under Distress Testing Downside-Risk Efficiency Under Distress Jesus Gonzalo Universidad Carlos III de Madrid Jose Olmo City University of London XXXIII Simposio Analisis Economico 1 Some key lines Risk vs Uncertainty.

More information

Modern Portfolio Theory with Homogeneous Risk Measures

Modern Portfolio Theory with Homogeneous Risk Measures Modern Portfolio Theory with Homogeneous Risk Measures Dirk Tasche Zentrum Mathematik Technische Universität München http://www.ma.tum.de/stat/ Rotterdam February 8, 2001 Abstract The Modern Portfolio

More information

arxiv: v2 [cs.ds] 27 Nov 2014

arxiv: v2 [cs.ds] 27 Nov 2014 Single machine scheduling problems with uncertain parameters and the OWA criterion arxiv:1405.5371v2 [cs.ds] 27 Nov 2014 Adam Kasperski Institute of Industrial Engineering and Management, Wroc law University

More information

Robust Multicriteria Risk-Averse Stochastic Programming Models

Robust Multicriteria Risk-Averse Stochastic Programming Models Robust Multicriteria Risk-Averse Stochastic Programming Models Xiao Liu, Simge Küçükyavuz Department of Integrated Systems Engineering, The Ohio State University, U.S.A. liu.2738@osu.edu, kucukyavuz.2@osu.edu

More information

Efficient optimization of the reward-risk ratio with polyhedral risk measures

Efficient optimization of the reward-risk ratio with polyhedral risk measures Math Meth Oper Res (2017) 86:625 653 https://doi.org/10.1007/s00186-017-0613-1 ORIGINAL ARTICLE Efficient optimization of the reward-risk ratio with polyhedral risk measures Wlodzimierz Ogryczak 1 Michał

More information

Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization

Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization Instructor: Farid Alizadeh Author: Ai Kagawa 12/12/2012

More information

Motivation General concept of CVaR Optimization Comparison. VaR and CVaR. Přemysl Bejda.

Motivation General concept of CVaR Optimization Comparison. VaR and CVaR. Přemysl Bejda. VaR and CVaR Přemysl Bejda premyslbejda@gmail.com 2014 Contents 1 Motivation 2 General concept of CVaR 3 Optimization 4 Comparison Contents 1 Motivation 2 General concept of CVaR 3 Optimization 4 Comparison

More information

A Probabilistic Model for Minmax Regret in Combinatorial Optimization

A Probabilistic Model for Minmax Regret in Combinatorial Optimization A Probabilistic Model for Minmax Regret in Combinatorial Optimization Karthik Natarajan Dongjian Shi Kim-Chuan Toh May 21, 2013 Abstract In this paper, we propose a new probabilistic model for minimizing

More information

Thomas Knispel Leibniz Universität Hannover

Thomas Knispel Leibniz Universität Hannover Optimal long term investment under model ambiguity Optimal long term investment under model ambiguity homas Knispel Leibniz Universität Hannover knispel@stochastik.uni-hannover.de AnStAp0 Vienna, July

More information

Aggregate Risk. MFM Practitioner Module: Quantitative Risk Management. John Dodson. February 6, Aggregate Risk. John Dodson.

Aggregate Risk. MFM Practitioner Module: Quantitative Risk Management. John Dodson. February 6, Aggregate Risk. John Dodson. MFM Practitioner Module: Quantitative Risk Management February 6, 2019 As we discussed last semester, the general goal of risk measurement is to come up with a single metric that can be used to make financial

More information

Scenario estimation and generation

Scenario estimation and generation October 10, 2004 The one-period case Distances of Probability Measures Tensor products of trees Tree reduction A decision problem is subject to uncertainty Uncertainty is represented by probability To

More information

Stochastic Dominance and Prospect Dominance with Subjective Weighting Functions

Stochastic Dominance and Prospect Dominance with Subjective Weighting Functions Stochastic Dominance and Prospect Dominance with Subjective Weighting Functions Haim Levy *, Zvi Wiener * Second version 2/15/98 Please address your correspondence to Haim Levy at Business School, The

More information

Bayesian Optimization

Bayesian Optimization Practitioner Course: Portfolio October 15, 2008 No introduction to portfolio optimization would be complete without acknowledging the significant contribution of the Markowitz mean-variance efficient frontier

More information

Optimization Tools in an Uncertain Environment

Optimization Tools in an Uncertain Environment Optimization Tools in an Uncertain Environment Michael C. Ferris University of Wisconsin, Madison Uncertainty Workshop, Chicago: July 21, 2008 Michael Ferris (University of Wisconsin) Stochastic optimization

More information

Stochastic Programming with Multivariate Second Order Stochastic Dominance Constraints with Applications in Portfolio Optimization

Stochastic Programming with Multivariate Second Order Stochastic Dominance Constraints with Applications in Portfolio Optimization Stochastic Programming with Multivariate Second Order Stochastic Dominance Constraints with Applications in Portfolio Optimization Rudabeh Meskarian 1 Department of Engineering Systems and Design, Singapore

More information

ST5215: Advanced Statistical Theory

ST5215: Advanced Statistical Theory Department of Statistics & Applied Probability Wednesday, October 5, 2011 Lecture 13: Basic elements and notions in decision theory Basic elements X : a sample from a population P P Decision: an action

More information

Dual representations of risk measures

Dual representations of risk measures May 7, 2005 The variance and similar pure risk measures The standard deviation and similar pure risk measures The lower semi-variance and similar pure risk measures The lower semi-standard deviation and

More information

MFM Practitioner Module: Risk & Asset Allocation. John Dodson. February 18, 2015

MFM Practitioner Module: Risk & Asset Allocation. John Dodson. February 18, 2015 MFM Practitioner Module: Risk & Asset Allocation February 18, 2015 No introduction to portfolio optimization would be complete without acknowledging the significant contribution of the Markowitz mean-variance

More information

FE670 Algorithmic Trading Strategies. Stevens Institute of Technology

FE670 Algorithmic Trading Strategies. Stevens Institute of Technology FE670 Algorithmic Trading Strategies Lecture 8. Robust Portfolio Optimization Steve Yang Stevens Institute of Technology 10/17/2013 Outline 1 Robust Mean-Variance Formulations 2 Uncertain in Expected Return

More information

MFM Practitioner Module: Risk & Asset Allocation. John Dodson. January 25, 2012

MFM Practitioner Module: Risk & Asset Allocation. John Dodson. January 25, 2012 MFM Practitioner Module: Risk & Asset Allocation January 25, 2012 Optimizing Allocations Once we have 1. chosen the markets and an investment horizon 2. modeled the markets 3. agreed on an objective with

More information

On LP Solvable Models for Portfolio Selection

On LP Solvable Models for Portfolio Selection INFORMATICA, 2003, Vol. 14, No. 1, 37 62 37 2003 Institute of Mathematics and Informatics, Vilnius On LP Solvable Models for Portfolio Selection Renata MANSINI Department of Electronics for Automation,

More information

Stochastic Dual Dynamic Programming with CVaR Risk Constraints Applied to Hydrothermal Scheduling. ICSP 2013 Bergamo, July 8-12, 2012

Stochastic Dual Dynamic Programming with CVaR Risk Constraints Applied to Hydrothermal Scheduling. ICSP 2013 Bergamo, July 8-12, 2012 Stochastic Dual Dynamic Programming with CVaR Risk Constraints Applied to Hydrothermal Scheduling Luiz Carlos da Costa Junior Mario V. F. Pereira Sérgio Granville Nora Campodónico Marcia Helena Costa Fampa

More information

HJB equations. Seminar in Stochastic Modelling in Economics and Finance January 10, 2011

HJB equations. Seminar in Stochastic Modelling in Economics and Finance January 10, 2011 Department of Probability and Mathematical Statistics Faculty of Mathematics and Physics, Charles University in Prague petrasek@karlin.mff.cuni.cz Seminar in Stochastic Modelling in Economics and Finance

More information

A Stochastic-Oriented NLP Relaxation for Integer Programming

A Stochastic-Oriented NLP Relaxation for Integer Programming A Stochastic-Oriented NLP Relaxation for Integer Programming John Birge University of Chicago (With Mihai Anitescu (ANL/U of C), Cosmin Petra (ANL)) Motivation: The control of energy systems, particularly

More information

Distributionally Robust Convex Optimization

Distributionally Robust Convex Optimization Submitted to Operations Research manuscript OPRE-2013-02-060 Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However,

More information

Are Probabilities Used in Markets? 1

Are Probabilities Used in Markets? 1 Journal of Economic Theory 91, 8690 (2000) doi:10.1006jeth.1999.2590, available online at http:www.idealibrary.com on NOTES, COMMENTS, AND LETTERS TO THE EDITOR Are Probabilities Used in Markets? 1 Larry

More information

Sharp bounds on the VaR for sums of dependent risks

Sharp bounds on the VaR for sums of dependent risks Paul Embrechts Sharp bounds on the VaR for sums of dependent risks joint work with Giovanni Puccetti (university of Firenze, Italy) and Ludger Rüschendorf (university of Freiburg, Germany) Mathematical

More information

Information Choice in Macroeconomics and Finance.

Information Choice in Macroeconomics and Finance. Information Choice in Macroeconomics and Finance. Laura Veldkamp New York University, Stern School of Business, CEPR and NBER Spring 2009 1 Veldkamp What information consumes is rather obvious: It consumes

More information

LP Solvable Models for Portfolio Optimization: A Survey and Comparison - Part I

LP Solvable Models for Portfolio Optimization: A Survey and Comparison - Part I LP Solvable Models for Portfolio Optimization: A Survey and Comparison - Part I Renata Mansini,W lodzimierz Ogryczak, M. Grazia Speranza May 1, 2001 Abstract The Markowitz model of portfolio optimization

More information

Intertemporal Risk Aversion, Stationarity, and Discounting

Intertemporal Risk Aversion, Stationarity, and Discounting Traeger, CES ifo 10 p. 1 Intertemporal Risk Aversion, Stationarity, and Discounting Christian Traeger Department of Agricultural & Resource Economics, UC Berkeley Introduce a more general preference representation

More information

1: PROBABILITY REVIEW

1: PROBABILITY REVIEW 1: PROBABILITY REVIEW Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) Slides 1: Probability Review 1 / 56 Outline We will review the following

More information

Generalized Hypothesis Testing and Maximizing the Success Probability in Financial Markets

Generalized Hypothesis Testing and Maximizing the Success Probability in Financial Markets Generalized Hypothesis Testing and Maximizing the Success Probability in Financial Markets Tim Leung 1, Qingshuo Song 2, and Jie Yang 3 1 Columbia University, New York, USA; leung@ieor.columbia.edu 2 City

More information

Perturbative Approaches for Robust Intertemporal Optimal Portfolio Selection

Perturbative Approaches for Robust Intertemporal Optimal Portfolio Selection Perturbative Approaches for Robust Intertemporal Optimal Portfolio Selection F. Trojani and P. Vanini ECAS Course, Lugano, October 7-13, 2001 1 Contents Introduction Merton s Model and Perturbative Solution

More information

Lecture notes on statistical decision theory Econ 2110, fall 2013

Lecture notes on statistical decision theory Econ 2110, fall 2013 Lecture notes on statistical decision theory Econ 2110, fall 2013 Maximilian Kasy March 10, 2014 These lecture notes are roughly based on Robert, C. (2007). The Bayesian choice: from decision-theoretic

More information

Pareto Efficiency in Robust Optimization

Pareto Efficiency in Robust Optimization Pareto Efficiency in Robust Optimization Dan Iancu Graduate School of Business Stanford University joint work with Nikolaos Trichakis (HBS) 1/26 Classical Robust Optimization Typical linear optimization

More information

Financial Optimization ISE 347/447. Lecture 21. Dr. Ted Ralphs

Financial Optimization ISE 347/447. Lecture 21. Dr. Ted Ralphs Financial Optimization ISE 347/447 Lecture 21 Dr. Ted Ralphs ISE 347/447 Lecture 21 1 Reading for This Lecture C&T Chapter 16 ISE 347/447 Lecture 21 2 Formalizing: Random Linear Optimization Consider the

More information

Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)

Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers) Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers) Solution only depends on a small subset of training

More information

A Robust Portfolio Technique for Mitigating the Fragility of CVaR Minimization

A Robust Portfolio Technique for Mitigating the Fragility of CVaR Minimization A Robust Portfolio Technique for Mitigating the Fragility of CVaR Minimization Jun-ya Gotoh Department of Industrial and Systems Engineering Chuo University 2-3-27 Kasuga, Bunkyo-ku, Tokyo 2-855, Japan

More information

Combinatorial Data Mining Method for Multi-Portfolio Stochastic Asset Allocation

Combinatorial Data Mining Method for Multi-Portfolio Stochastic Asset Allocation Combinatorial for Stochastic Asset Allocation Ran Ji, M.A. Lejeune Department of Decision Sciences July 8, 2013 Content Class of Models with Downside Risk Measure Class of Models with of multiple portfolios

More information

Support Vector Machine

Support Vector Machine Andrea Passerini passerini@disi.unitn.it Machine Learning Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)

More information

Nonlinear Optimization: The art of modeling

Nonlinear Optimization: The art of modeling Nonlinear Optimization: The art of modeling INSEAD, Spring 2006 Jean-Philippe Vert Ecole des Mines de Paris Jean-Philippe.Vert@mines.org Nonlinear optimization c 2003-2006 Jean-Philippe Vert, (Jean-Philippe.Vert@mines.org)

More information

Central-limit approach to risk-aware Markov decision processes

Central-limit approach to risk-aware Markov decision processes Central-limit approach to risk-aware Markov decision processes Jia Yuan Yu Concordia University November 27, 2015 Joint work with Pengqian Yu and Huan Xu. Inventory Management 1 1 Look at current inventory

More information

Optimization Problems with Probabilistic Constraints

Optimization Problems with Probabilistic Constraints Optimization Problems with Probabilistic Constraints R. Henrion Weierstrass Institute Berlin 10 th International Conference on Stochastic Programming University of Arizona, Tucson Recommended Reading A.

More information

Generalized quantiles as risk measures

Generalized quantiles as risk measures Generalized quantiles as risk measures Bellini, Klar, Muller, Rosazza Gianin December 1, 2014 Vorisek Jan Introduction Quantiles q α of a random variable X can be defined as the minimizers of a piecewise

More information

Order book resilience, price manipulation, and the positive portfolio problem

Order book resilience, price manipulation, and the positive portfolio problem Order book resilience, price manipulation, and the positive portfolio problem Alexander Schied Mannheim University Workshop on New Directions in Financial Mathematics Institute for Pure and Applied Mathematics,

More information

The newsvendor problem with convex risk

The newsvendor problem with convex risk UNIVERSIDAD CARLOS III DE MADRID WORKING PAPERS Working Paper Business Economic Series WP. 16-06. December, 12 nd, 2016. ISSN 1989-8843 Instituto para el Desarrollo Empresarial Universidad Carlos III de

More information

CVaR and Examples of Deviation Risk Measures

CVaR and Examples of Deviation Risk Measures CVaR and Examples of Deviation Risk Measures Jakub Černý Department of Probability and Mathematical Statistics Stochastic Modelling in Economics and Finance November 10, 2014 1 / 25 Contents CVaR - Dual

More information

Decomposability and time consistency of risk averse multistage programs

Decomposability and time consistency of risk averse multistage programs Decomposability and time consistency of risk averse multistage programs arxiv:1806.01497v1 [math.oc] 5 Jun 2018 A. Shapiro School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta,

More information

Robust Backtesting Tests for Value-at-Risk Models

Robust Backtesting Tests for Value-at-Risk Models Robust Backtesting Tests for Value-at-Risk Models Jose Olmo City University London (joint work with Juan Carlos Escanciano, Indiana University) Far East and South Asia Meeting of the Econometric Society

More information

Distributionally Robust Convex Optimization

Distributionally Robust Convex Optimization Distributionally Robust Convex Optimization Wolfram Wiesemann 1, Daniel Kuhn 1, and Melvyn Sim 2 1 Department of Computing, Imperial College London, United Kingdom 2 Department of Decision Sciences, National

More information

Asymptotic distribution of the sample average value-at-risk

Asymptotic distribution of the sample average value-at-risk Asymptotic distribution of the sample average value-at-risk Stoyan V. Stoyanov Svetlozar T. Rachev September 3, 7 Abstract In this paper, we prove a result for the asymptotic distribution of the sample

More information

Statistical Approaches to Learning and Discovery. Week 4: Decision Theory and Risk Minimization. February 3, 2003

Statistical Approaches to Learning and Discovery. Week 4: Decision Theory and Risk Minimization. February 3, 2003 Statistical Approaches to Learning and Discovery Week 4: Decision Theory and Risk Minimization February 3, 2003 Recall From Last Time Bayesian expected loss is ρ(π, a) = E π [L(θ, a)] = L(θ, a) df π (θ)

More information

Utility Maximization in Hidden Regime-Switching Markets with Default Risk

Utility Maximization in Hidden Regime-Switching Markets with Default Risk Utility Maximization in Hidden Regime-Switching Markets with Default Risk José E. Figueroa-López Department of Mathematics and Statistics Washington University in St. Louis figueroa-lopez@wustl.edu pages.wustl.edu/figueroa

More information

Convex optimization problems. Optimization problem in standard form

Convex optimization problems. Optimization problem in standard form Convex optimization problems optimization problem in standard form convex optimization problems linear optimization quadratic optimization geometric programming quasiconvex optimization generalized inequality

More information

Robust Multicriteria Risk Averse Stochastic Programming Models

Robust Multicriteria Risk Averse Stochastic Programming Models Robust Multicriteria Risk Averse Stochastic Programming Models Xiao Liu Department of Integrated Systems Engineering, The Ohio State University, U.S.A. liu.2738@osu.edu Simge Küçükyavuz Industrial and

More information

J. Marín-Solano (UB), M. Bosch-Príncep (UB), J. Dhaene (KUL), C. Ribas (UB), O. Roch (UB), S. Vanduffel (KUL)

J. Marín-Solano (UB), M. Bosch-Príncep (UB), J. Dhaene (KUL), C. Ribas (UB), O. Roch (UB), S. Vanduffel (KUL) BUY AND HOLD STRATEGIES IN OPTIMAL PORTFOLIO SELECTION PROBLEMS: COMONOTONIC APPROXIMATIONS J. Marín-Solano (UB), M. Bosch-Príncep (UB), J. Dhaene (KUL), C. Ribas (UB), O. Roch (UB), S. Vanduffel (KUL)

More information

Stochastic dominance and risk measure: A decision-theoretic foundation for VaR and C-VaR

Stochastic dominance and risk measure: A decision-theoretic foundation for VaR and C-VaR Hong Kong Baptist University HKBU Institutional Repository Department of Economics Journal Articles Department of Economics 2010 Stochastic dominance and risk measure: A decision-theoretic foundation for

More information

A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance

A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance Seung Jean Kim Stephen Boyd Alessandro Magnani MIT ORC Sear 12/8/05 Outline A imax theorem Robust Fisher discriant

More information

MEASURES OF RISK IN STOCHASTIC OPTIMIZATION

MEASURES OF RISK IN STOCHASTIC OPTIMIZATION MEASURES OF RISK IN STOCHASTIC OPTIMIZATION R. T. Rockafellar University of Washington, Seattle University of Florida, Gainesville Insitute for Mathematics and its Applications University of Minnesota

More information

Beyond average and minimax in MILP

Beyond average and minimax in MILP Beyond average and minimax in MILP [source file: MinMaxBeta-MILP COR-5.tex] Carlo Filippi W lodzimierz Ogryczak M. Grazia Speranza Abstract Mixed-Integer Linear Programming (MILP) models often optimize

More information

Distributionally Robust Stochastic Optimization with Wasserstein Distance

Distributionally Robust Stochastic Optimization with Wasserstein Distance Distributionally Robust Stochastic Optimization with Wasserstein Distance Rui Gao DOS Seminar, Oct 2016 Joint work with Anton Kleywegt School of Industrial and Systems Engineering Georgia Tech What is

More information

Robust Optimal Taxation and Environmental Externalities

Robust Optimal Taxation and Environmental Externalities Robust Optimal Taxation and Environmental Externalities Xin Li Borghan Narajabad Ted Loch-Temzelides Department of Economics Rice University Outline Outline 1 Introduction 2 One-Energy-Sector Model 3 Complete

More information

Evaluation of Decision Rules in Robust Portfolio Modeling

Evaluation of Decision Rules in Robust Portfolio Modeling Mat-2.4108 Independent Research Proects in Applied Mathematics Evaluation of Decision Rules in Robust Portfolio Modeling Juha Saloheimo 57739V TKK, Department of Mathematics and System Analysis 4.8.2008

More information

Coherent Risk Measures. Acceptance Sets. L = {X G : X(ω) < 0, ω Ω}.

Coherent Risk Measures. Acceptance Sets. L = {X G : X(ω) < 0, ω Ω}. So far in this course we have used several different mathematical expressions to quantify risk, without a deeper discussion of their properties. Coherent Risk Measures Lecture 11, Optimisation in Finance

More information

3E4: Modelling Choice

3E4: Modelling Choice 3E4: Modelling Choice Lecture 6 Goal Programming Multiple Objective Optimisation Portfolio Optimisation Announcements Supervision 2 To be held by the end of next week Present your solutions to all Lecture

More information

POLYNOMIAL-TIME IDENTIFICATION OF ROBUST NETWORK FLOWS UNDER UNCERTAIN ARC FAILURES

POLYNOMIAL-TIME IDENTIFICATION OF ROBUST NETWORK FLOWS UNDER UNCERTAIN ARC FAILURES POLYNOMIAL-TIME IDENTIFICATION OF ROBUST NETWORK FLOWS UNDER UNCERTAIN ARC FAILURES VLADIMIR L. BOGINSKI, CLAYTON W. COMMANDER, AND TIMOFEY TURKO ABSTRACT. We propose LP-based solution methods for network

More information

Complexity of two and multi-stage stochastic programming problems

Complexity of two and multi-stage stochastic programming problems Complexity of two and multi-stage stochastic programming problems A. Shapiro School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205, USA The concept

More information

Research Article Optimal Portfolio Estimation for Dependent Financial Returns with Generalized Empirical Likelihood

Research Article Optimal Portfolio Estimation for Dependent Financial Returns with Generalized Empirical Likelihood Advances in Decision Sciences Volume 2012, Article ID 973173, 8 pages doi:10.1155/2012/973173 Research Article Optimal Portfolio Estimation for Dependent Financial Returns with Generalized Empirical Likelihood

More information

arxiv: v3 [math.oc] 25 Apr 2018

arxiv: v3 [math.oc] 25 Apr 2018 Problem-driven scenario generation: an analytical approach for stochastic programs with tail risk measure Jamie Fairbrother *, Amanda Turner *, and Stein W. Wallace ** * STOR-i Centre for Doctoral Training,

More information

Machine learning, shrinkage estimation, and economic theory

Machine learning, shrinkage estimation, and economic theory Machine learning, shrinkage estimation, and economic theory Maximilian Kasy December 14, 2018 1 / 43 Introduction Recent years saw a boom of machine learning methods. Impressive advances in domains such

More information

Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)

Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers) Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers) Solution only depends on a small subset of training

More information

Lecture Support Vector Machine (SVM) Classifiers

Lecture Support Vector Machine (SVM) Classifiers Introduction to Machine Learning Lecturer: Amir Globerson Lecture 6 Fall Semester Scribe: Yishay Mansour 6.1 Support Vector Machine (SVM) Classifiers Classification is one of the most important tasks in

More information

Research Article Continuous Time Portfolio Selection under Conditional Capital at Risk

Research Article Continuous Time Portfolio Selection under Conditional Capital at Risk Hindawi Publishing Corporation Journal of Probability and Statistics Volume 2010, Article ID 976371, 26 pages doi:10.1155/2010/976371 Research Article Continuous Time Portfolio Selection under Conditional

More information

Risk Management of Portfolios by CVaR Optimization

Risk Management of Portfolios by CVaR Optimization Risk Management of Portfolios by CVaR Optimization Thomas F. Coleman a Dept of Combinatorics & Optimization University of Waterloo a Ophelia Lazaridis University Research Chair 1 Joint work with Yuying

More information

Robust multi-sensor scheduling for multi-site surveillance

Robust multi-sensor scheduling for multi-site surveillance DOI 10.1007/s10878-009-9271-4 Robust multi-sensor scheduling for multi-site surveillance Nikita Boyko Timofey Turko Vladimir Boginski David E. Jeffcoat Stanislav Uryasev Grigoriy Zrazhevsky Panos M. Pardalos

More information

Econ 2148, spring 2019 Statistical decision theory

Econ 2148, spring 2019 Statistical decision theory Econ 2148, spring 2019 Statistical decision theory Maximilian Kasy Department of Economics, Harvard University 1 / 53 Takeaways for this part of class 1. A general framework to think about what makes a

More information

Markowitz Efficient Portfolio Frontier as Least-Norm Analytic Solution to Underdetermined Equations

Markowitz Efficient Portfolio Frontier as Least-Norm Analytic Solution to Underdetermined Equations Markowitz Efficient Portfolio Frontier as Least-Norm Analytic Solution to Underdetermined Equations Sahand Rabbani Introduction Modern portfolio theory deals in part with the efficient allocation of investments

More information

Machine Learning And Applications: Supervised Learning-SVM

Machine Learning And Applications: Supervised Learning-SVM Machine Learning And Applications: Supervised Learning-SVM Raphaël Bournhonesque École Normale Supérieure de Lyon, Lyon, France raphael.bournhonesque@ens-lyon.fr 1 Supervised vs unsupervised learning Machine

More information

Structural and Multidisciplinary Optimization. P. Duysinx and P. Tossings

Structural and Multidisciplinary Optimization. P. Duysinx and P. Tossings Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be

More information

Short course on Comparative Statics and Comparative Information

Short course on Comparative Statics and Comparative Information Short course on Comparative Statics and Comparative Information Course description: This course provides a concise and accessible introduction to some basic concepts and techniques used when comparing

More information

Robust Growth-Optimal Portfolios

Robust Growth-Optimal Portfolios Robust Growth-Optimal Portfolios! Daniel Kuhn! Chair of Risk Analytics and Optimization École Polytechnique Fédérale de Lausanne rao.epfl.ch 4 Technology Stocks I 4 technology companies: Intel, Cisco,

More information

Notes on Heterogeneity, Aggregation, and Market Wage Functions: An Empirical Model of Self-Selection in the Labor Market

Notes on Heterogeneity, Aggregation, and Market Wage Functions: An Empirical Model of Self-Selection in the Labor Market Notes on Heterogeneity, Aggregation, and Market Wage Functions: An Empirical Model of Self-Selection in the Labor Market Heckman and Sedlacek, JPE 1985, 93(6), 1077-1125 James Heckman University of Chicago

More information

Stochastic Optimization with Risk Measures

Stochastic Optimization with Risk Measures Stochastic Optimization with Risk Measures IMA New Directions Short Course on Mathematical Optimization Jim Luedtke Department of Industrial and Systems Engineering University of Wisconsin-Madison August

More information

Modelling Czech and Slovak labour markets: A DSGE model with labour frictions

Modelling Czech and Slovak labour markets: A DSGE model with labour frictions Modelling Czech and Slovak labour markets: A DSGE model with labour frictions Daniel Němec Faculty of Economics and Administrations Masaryk University Brno, Czech Republic nemecd@econ.muni.cz ESF MU (Brno)

More information

Time-varying Consumption Tax, Productive Government Spending, and Aggregate Instability.

Time-varying Consumption Tax, Productive Government Spending, and Aggregate Instability. Time-varying Consumption Tax, Productive Government Spending, and Aggregate Instability. Literature Schmitt-Grohe and Uribe (JPE 1997): Ramsey model with endogenous labor income tax + balanced budget (fiscal)

More information