Ambiguity in portfolio optimization
|
|
- Meghan Warner
- 5 years ago
- Views:
Transcription
1 May/June 2006
2 Introduction: Risk and Ambiguity Frank Knight Risk, Uncertainty and Profit (1920) Risk: the decision-maker can assign mathematical probabilities to random phenomena Uncertainty: randomness cannot be expressed in terms of specific mathematical models. Ellsberg (1961) Uncertainty: the probabilistic model is known, but the realizations of the random variables are unknown ( aleatoric uncertainty ) Ambiguity: the probability model itself is unknown ( epistemic uncertainty ).
3 It has frequently been observed that the solutions of portfolio optimization problems are much sensitive w.r.t. the parameters of the distributions (Klein and Bawa (1976), Chopra and Ziemba (1993)). However, the distributions are estimated from data and therefore contain some estimation error and model ambiguity. Therefore we need to combine Statistics ( how to estimate the probability model and its parameters and to assess confidence ) and Optimization ( how to find the best decision ) in one approach.
4 Problem formulation (ξ 1,..., ξ M ) random returns for M asset categories (x 1,..., x M ) portfolio weights Y x = M m=1 x mξ m portfolio return A(Y x ) acceptability functional Let ˆP be a baseline probability measure for (ξ 1,..., ξ M ). If we fully trust in the validity of this model, we solve the non-ambiguous portfolio optimization problem Maximize (in x) : EˆP (Y x) subject to AˆP (Y x) q x 1l = 1 x 0
5 Acceptability functionals Required properties: (i) translation equivariance (ii) concavity A(Y + c) = A(Y ) + c A(λY 1 + (1 λ)y 2 ) λa(y 1 ) + (1 λ)a(y 2 ). (iii) continuity Y A(Y ) continuous (iv) version independence: If Y 1 and Y 2 have the same distribution, then A(Y 1 ) = A(Y 2 )
6 s for such acceptability functionals A are the expectation A(Y ) = E(Y ) the average-value-at risk (conditional value-at-risk, expected shortfall) A(Y ) = AV@R α (Y ) = 1 α α G 1 Y 0 (p) dp, where G 1 Y (p) = inf{v : P{Y v} p} the (lower) standard deviation corrected expectation (0 < λ < 1) A(Y ) = E(Y ) λstd(y ) or E(Y ) λstd (Y ), Std (Y ) = E[[Y EY ] ) 2
7 Stress testing We solve the portfolio problem for the baseline probability model, but check its performance under new probability models. : 500 historic weakly returns from NYSE model composition optimal for weakly return acceptabilty AV@R 0.1 (ˆP) (ˆP) 0.8% 0.92 (P ) (ˆP) -0.13% 0.90 (P + ) (ˆP) 1.17% 0.93 (P ) (P ) -0.07% 0.92 (P + ) (P + ) 1.9% 0.92 (ˆP) : historic data (P ) : 5% higher prob. for bad scenarios (P + ) : 5% lower prob. for bad scenarios
8 The ambiguity problem - maximin formulation Let P be an ambiguity set, i.e. the set of probability models, to which the modeler in indifferent. The portfolio selection model under P-ambiguity is of maximin type and reads Maximize (in x) : min{e P (Y x ) : P P} subject to A P (Y x ) q for all P P x 1l = 1 x 0
9 Dealing with uncertainty: Deterministic optimization: max{f (x) : F i (x) 0} F is the objective, F i are the constraint functions. Robust optimization (maximin approach): A set Ξ of possible parameters ξ is given. max{min{f (x, ξ) : ξ Ξ} : F i (x, ξ) 0; ξ Ξ} Robust optimization produces very conservative portfolios.
10 Stochastic optimization: (Ξ, A, P) is a probability space, typical element is called ξ. or more generally max{e P [F (x, ξ)]; E P [F i (x, ξ)] 0} max{a P [F (x, ξ)]; A (i) P [F i(x, ξ)] 0} where A ( ) P are aggregating probability functionals, mapping the distribution of F (x, ξ) under P to the (extended) real line. Stochastic optimization produces well diversified portfolios.
11 Robust Opt. Stochastic Opt. Robust Stoch. Opt. Bayesian Opt.??
12 The ambiguity problem - Bayesian formulation Let λ be a probability on the ambiguity set P. λ is called the Bayesian prior on the set of probability models. The Bayesian formulation is Maximize (in x) : P A P[F (x, ξ)] dλ(p) subject to P A(i) P [F i(x, ξ)] dλ(p) 0 x 1l = 1 x 0
13 The ambiguity problem as robust stochastic optimization We repeat the maximin formulation of the problem: Maximize (in x) : min{e P (Y x ) : P P} subject to A P (Y x ) q for all P P x 1l = 1 x 0
14 for the maximin portfolio problem Let X = {x : x 1l = 1, x 0, A P (Y x ) q for all P P}, then the ambiguity problem reads max min E P[Y x ]. x X P P By continuity and concavity of A, X is a compact convex set. Moreover, (P, x) E P [Y x ] is bilinear in P and x and hence convex-concave. Therefore x X is a solution of if and only if there is a P P such that (P, x ) is a saddle point, i.e. E P [Y x ] E P [Y x ] E P [Y x ] for all (P, x) P X. Our problem is semi-infinite. Direct saddle point methods were used by Rockafellar (1976), Nemirovskii and Yudin (1978).
15 Successive convex programming (SCP) 1. Set n = 0 and P 0 = {ˆP} with ˆP P. 2. Solve the outer problem Maximize (in x, t) : t subject to t E P (Y x ) for all P P n A P (Y x ) q for all P P n x 1l = 1; x 0 and call the solution (x n, t n ). 3. Solve the first inner problem Minimize (in P) : E P (Y xn ) subject to P P and call the solution P (1) n.
16 4. Solve the second inner problem Minimize (in P) : A P (Y xn ) subject to P P call the solution P (2) n and let P n+1 = P n {P (1) n } {P (2) n }. 5. If P n+1 = P n then stop. Otherwise set n := n + 1 and goto 2.
17 Convergence Proposition. Assume that P is compact and convex and that (P, x) E P [Y x ] as well as (P, x) A P [Y x ] are jointly continuous. Then every cluster point of (x n ) is a solution of the minimax problem. If the saddle point is unique, then the algorithm converges to the optimal solution.
18 ˆP
19 ˆP P 1
20 ˆP P 1 P 2
21 ˆP P 3 P 1 P 2
22 Ambiguity sets as balls - distances of probability measures We want to use an ambiguity sets of the form P = {P : d(p, P ) ɛ} as ambiguity sets. But which distance d to choose? Transportation distance, Wasserstein distance d T (P 1, P 2 ) = sup{ h(u) dp 1 (u) h(u) dp 2 (u) : h(u) h(v) u v }
23 Kolmogorov-Smirnov distance d KS (P 1, P 2 ) = sup{ P 1 ((, a]) P 2 ((, a]) : a R} Variational distance d V (P 1, P 2 ) = sup{ P 1 (A) P 2 (A) : A mesurable } If densities exist, this is equivalent to the L 1 distance: dp 1 d L1 (P 1, P 2 ) = dµ dp 2 dµ dµ.
24 The ambiguity set must reflect our current information about P If our information is based on statistical estimation, the ambiguity set must coincide with a confidence set If the distance is too fine, no statistical confidence set can be constructed without further assumptions (e.g. for the variational distance) If we base our estimate for P on some historical data ξ 1, ξ 2,..., ξ n, we use the empirical distribution ˆP n {ξ i } = 1 n
25 Confidence sets P{d KS (P, ˆP n ) M/ n} 58 exp( 2M 2 ) (Dvoretzky, Kiefer, Wolfowitz inequality) E P [d T (P, ˆP n )] Cn 1/M for some constant C (Dudley (1969)). By Markov s inequality P{d T (P, ˆP n ) ɛ} E[d(P, ˆP n )]/ɛ n 1/M C/ɛ. Under smoothness conditions on P, the confidence sets may improved (Kersting (1978)).
26 6 assets IBM - International Business Machines Corporation PRG - Procter & Gamble Corporation ATT - AT&T Corporation VER - Verizon Communications Inc INT - Intel Corporation EXX - Exxon Mobil Corporation Risk constraint: AV@R 0,1 0.9 Ambiguity set: P = {P : d T (P, ˆP) ɛ}. In order to make the ambiguity sets more interpretable, we define a robustness parameter γ as the maximal relative change of the expected returns and relate this to ɛ by ɛ = max{η : sup E P (ξ (i) ) (1 + γ)eˆp (ξ(i) ) : for all i}. d T (P,ˆP) η
27 Working with Transportation distances By the well known theorem of Kantorovich-Rubinstein, the Transportation ambiguity set can be represented as {P : d T (P, ˆP) ɛ} = {P : there is a bivariate probability K(, ) s.t. K(u, dv) = P(u); K(du, v) = ˆP(v); u v 1 K(du, dv) ɛ}. v u If the probability space Ω is finite, Ω = {x (1),..., x (n) }, the ambiguity set is a polyhedral set u v {P : d T (P, ˆP) ɛ} = {P = (P 1,..., P S ) : P j = i K ij ; j K ij = ˆP i ; K ij 0; i,j x (i) x (j) 1 K ij ɛ}.
28 Illustration of the Transportation distance P 1 P 2 d T (P 1, P 2 ) = minimal E ( transported mass distance ).
29 The bivariate probability K has the interpretation as the solution of Monge s mass transportation problem. The Transportation distance describes the minimal effort (in terms of expected transportation distances), to change the mass distribution ˆP into the new mass distribution P (Rachev and Rüschendorf (1998)). In the case of a finite probability space Ω it is not difficult to find a solution for the inner problems, i.e. to determine and by a special algorithm. inf{e P (Y x ) : d T (P, ˆP) ɛ} inf{a P (Y x ) : d T (P, ˆP) ɛ}
30 The solution of the Return Basic Probability Model Worst Case Probability Model Robustness Risk Basic Probability Model Worst Case Probability Model Robustness Portfolio Composition Robustness Expected returns, risks and portfolio composition. The assets from top to bottom are: EXX, VER, ATT, PRG, INT, IBM.
31 1.025 Basic Return Robustness Risk Efficient frontiers in dependence of the robustness parameter γ. Risk and return are calculated w.r.t. the basic model ˆP.
32 1.03 Worts Case Return Robustness Risk Efficient frontiers in dependence of the robustness parameter γ. Risk and return are calculated w.r.t. the worst case model.
33 Types of problems in Finance and Risk management Estimation Modeling Pricing (Equation solving): F (x) = y Optimization: max F (x) Game Theory (Equilibrium): max min F (x, y)
34 In order to capture scenario uncertainty (aleatoric uncertainty) and probability ambiguity (epistemic uncertainty) we use a probabilistic maximin approach. The ambiguity neighborhood should be chosen in such a way that it corresponds to a probabilistic confidence regions for which bounds for the covering probability are available. The result of model ambiguity is a further diversification of he portfolio It turns out that often the price to be paid for including ambiguity in the optimization problem is very little. Minimax models are also relevant for the pricing of swing options in Electricity markets.
Ambiguity in portfolio selection
Ambiguity in portfolio selection Georg Pflug David Wozabal Abstract In this paper, we consider the problem of finding optimal portfolios in cases when the underlying probability model is not perfectly
More informationOptimization of nonstandard risk functionals
21.7.2005 Risk functionals Properties Dual properties A collection of risk functionals Algorithms Properties Dual properties A collection of risk functionals Acceptability functionals - Basic properties
More informationScenario 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 informationIntroduction to Stochastic Optimization Part 4: Multi-stage decision
Introduction to Stochastic Optimization Part 4: Multi-stage decision problems April 23, 29 The problem ξ = (ξ,..., ξ T ) a multivariate time series process (e.g. future interest rates, future asset prices,
More informationRobustness and bootstrap techniques in portfolio efficiency tests
Robustness and bootstrap techniques in portfolio efficiency tests Dept. of Probability and Mathematical Statistics, Charles University, Prague, Czech Republic July 8, 2013 Motivation Portfolio selection
More informationDual 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 informationAcceptability functionals, risk capital functionals and risk deviation functionals: Primal and dual properties for one-and multiperiod models
Acceptability functionals, risk capital functionals and risk deviation functionals: Primal and dual properties for one-and multiperiod models 11.5.2005 Preliminary remark: risk measures risk functionals
More informationSemidefinite 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 informationA note on scenario reduction for two-stage stochastic programs
A note on scenario reduction for two-stage stochastic programs Holger Heitsch a and Werner Römisch a a Humboldt-University Berlin, Institute of Mathematics, 199 Berlin, Germany We extend earlier work on
More informationGeometry and Optimization of Relative Arbitrage
Geometry and Optimization of Relative Arbitrage Ting-Kam Leonard Wong joint work with Soumik Pal Department of Mathematics, University of Washington Financial/Actuarial Mathematic Seminar, University of
More informationData-Driven Risk-Averse Two-Stage Stochastic Program with ζ-structure Probability Metrics
Data-Driven Risk-Averse Two-Stage Stochastic Program with ζ-structure Probability Metrics Chaoyue Zhao and Yongpei Guan Department of Industrial and Systems Engineering University of Florida, Gainesville,
More informationRobustness 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 informationRobust 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 informationBirgit 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 informationRisk Measures in non-dominated Models
Purpose: Study Risk Measures taking into account the model uncertainty in mathematical finance. Plan 1 Non-dominated Models Model Uncertainty Fundamental topological Properties 2 Risk Measures on L p (c)
More informationPortfolio 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 informationDistributionally 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 informationRobust 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 informationOn deterministic reformulations of distributionally robust joint chance constrained optimization problems
On deterministic reformulations of distributionally robust joint chance constrained optimization problems Weijun Xie and Shabbir Ahmed School of Industrial & Systems Engineering Georgia Institute of Technology,
More informationOptimization 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 informationRobust Optimization for Risk Control in Enterprise-wide Optimization
Robust Optimization for Risk Control in Enterprise-wide Optimization Juan Pablo Vielma Department of Industrial Engineering University of Pittsburgh EWO Seminar, 011 Pittsburgh, PA Uncertainty in Optimization
More informationRobust control and applications in economic theory
Robust control and applications in economic theory In honour of Professor Emeritus Grigoris Kalogeropoulos on the occasion of his retirement A. N. Yannacopoulos Department of Statistics AUEB 24 May 2013
More informationThomas 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 informationRobust Efficient Frontier Analysis with a Separable Uncertainty Model
Robust Efficient Frontier Analysis with a Separable Uncertainty Model Seung-Jean Kim Stephen Boyd October 2007 Abstract Mean-variance (MV) analysis is often sensitive to model mis-specification or uncertainty,
More informationStatistical 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 informationORIGINS 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 informationNotes on Large Deviations in Economics and Finance. Noah Williams
Notes on Large Deviations in Economics and Finance Noah Williams Princeton University and NBER http://www.princeton.edu/ noahw Notes on Large Deviations 1 Introduction What is large deviation theory? Loosely:
More informationLecture 1. Stochastic Optimization: Introduction. January 8, 2018
Lecture 1 Stochastic Optimization: Introduction January 8, 2018 Optimization Concerned with mininmization/maximization of mathematical functions Often subject to constraints Euler (1707-1783): Nothing
More informationInformation theoretic perspectives on learning algorithms
Information theoretic perspectives on learning algorithms Varun Jog University of Wisconsin - Madison Departments of ECE and Mathematics Shannon Channel Hangout! May 8, 2018 Jointly with Adrian Tovar-Lopez
More informationStochastic Equilibrium Problems arising in the energy industry
Stochastic Equilibrium Problems arising in the energy industry Claudia Sagastizábal (visiting researcher IMPA) mailto:sagastiz@impa.br http://www.impa.br/~sagastiz ENEC workshop, IPAM, Los Angeles, January
More informationRisk Aggregation with Dependence Uncertainty
Introduction Extreme Scenarios Asymptotic Behavior Challenges Risk Aggregation with Dependence Uncertainty Department of Statistics and Actuarial Science University of Waterloo, Canada Seminar at ETH Zurich
More informationEcon 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 informationLecture 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 informationRobust 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 informationSOME 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 informationSet-Valued Risk Measures and Bellman s Principle
Set-Valued Risk Measures and Bellman s Principle Zach Feinstein Electrical and Systems Engineering, Washington University in St. Louis Joint work with Birgit Rudloff (Vienna University of Economics and
More informationTrajectorial Martingales, Null Sets, Convergence and Integration
Trajectorial Martingales, Null Sets, Convergence and Integration Sebastian Ferrando, Department of Mathematics, Ryerson University, Toronto, Canada Alfredo Gonzalez and Sebastian Ferrando Trajectorial
More informationarxiv: v2 [math.oc] 10 May 2017
Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls arxiv:1609.07505v2 [math.oc] 10 May 2017 Grani A. Hanasusanto 1 and Daniel Kuhn 2 1 Graduate
More informationOptimized Bonferroni Approximations of Distributionally Robust Joint Chance Constraints
Optimized Bonferroni Approximations of Distributionally Robust Joint Chance Constraints Weijun Xie 1, Shabbir Ahmed 2, Ruiwei Jiang 3 1 Department of Industrial and Systems Engineering, Virginia Tech,
More informationWorst-Case Violation of Sampled Convex Programs for Optimization with Uncertainty
Worst-Case Violation of Sampled Convex Programs for Optimization with Uncertainty Takafumi Kanamori and Akiko Takeda Abstract. Uncertain programs have been developed to deal with optimization problems
More informationDynamic Risk Measures and Nonlinear Expectations with Markov Chain noise
Dynamic Risk Measures and Nonlinear Expectations with Markov Chain noise Robert J. Elliott 1 Samuel N. Cohen 2 1 Department of Commerce, University of South Australia 2 Mathematical Insitute, University
More informationMathematical Methods and Economic Theory
Mathematical Methods and Economic Theory Anjan Mukherji Subrata Guha C 263944 OXTORD UNIVERSITY PRESS Contents Preface SECTION I 1 Introduction 3 1.1 The Objective 3 1.2 The Tools for Section I 4 2 Basic
More informationOptimization 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 informationApplications of axiomatic capital allocation and generalized weighted allocation
6 2010 11 ( ) Journal of East China Normal University (Natural Science) No. 6 Nov. 2010 Article ID: 1000-5641(2010)06-0146-10 Applications of axiomatic capital allocation and generalized weighted allocation
More informationQuantifying Stochastic Model Errors via Robust Optimization
Quantifying Stochastic Model Errors via Robust Optimization IPAM Workshop on Uncertainty Quantification for Multiscale Stochastic Systems and Applications Jan 19, 2016 Henry Lam Industrial & Operations
More informationValid 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 informationMathematical Optimization Models and Applications
Mathematical Optimization Models and Applications Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye Chapters 1, 2.1-2,
More informationOn Minimal Entropy Martingale Measures
On Minimal Entropy Martingale Measures Andrii Andrusiv Friedrich Schiller University of Jena, Germany Marie Curie ITN Outline 1. One Period Model Definitions and Notations Minimal Entropy Martingale Measure
More informationMultivariate comonotonicity, stochastic orders and risk measures
Multivariate comonotonicity, stochastic orders and risk measures Alfred Galichon (Ecole polytechnique) Brussels, May 25, 2012 Based on collaborations with: A. Charpentier (Rennes) G. Carlier (Dauphine)
More informationA Two-Stage Moment Robust Optimization Model and its Solution Using Decomposition
A Two-Stage Moment Robust Optimization Model and its Solution Using Decomposition Sanjay Mehrotra and He Zhang July 23, 2013 Abstract Moment robust optimization models formulate a stochastic problem with
More informationOptimal Risk Sharing with Optimistic and Pessimistic Decision Makers
Optimal Risk Sharing with Optimistic and Pessimistic Decision Makers A. Araujo 1,2, J.M. Bonnisseau 3, A. Chateauneuf 3 and R. Novinski 1 1 Instituto Nacional de Matematica Pura e Aplicada 2 Fundacao Getulio
More informationContents. Set Theory. Functions and its Applications CHAPTER 1 CHAPTER 2. Preface... (v)
(vii) Preface... (v) CHAPTER 1 Set Theory Definition of Set... 1 Roster, Tabular or Enumeration Form... 1 Set builder Form... 2 Union of Set... 5 Intersection of Sets... 9 Distributive Laws of Unions and
More informationDistributionally Robust Reward-risk Ratio Programming with Wasserstein Metric
oname manuscript o. will be inserted by the editor) Distributionally Robust Reward-risk Ratio Programming with Wasserstein Metric Yong Zhao Yongchao Liu Jin Zhang Xinmin Yang Received: date / Accepted:
More informationBandit models: a tutorial
Gdt COS, December 3rd, 2015 Multi-Armed Bandit model: general setting K arms: for a {1,..., K}, (X a,t ) t N is a stochastic process. (unknown distributions) Bandit game: a each round t, an agent chooses
More informationCompetitive Equilibria in a Comonotone Market
Competitive Equilibria in a Comonotone Market 1/51 Competitive Equilibria in a Comonotone Market Ruodu Wang http://sas.uwaterloo.ca/ wang Department of Statistics and Actuarial Science University of Waterloo
More informationGeneralized 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 informationOptimal Transport Methods in Operations Research and Statistics
Optimal Transport Methods in Operations Research and Statistics Jose Blanchet (based on work with F. He, Y. Kang, K. Murthy, F. Zhang). Stanford University (Management Science and Engineering), and Columbia
More informationStability of optimization problems with stochastic dominance constraints
Stability of optimization problems with stochastic dominance constraints D. Dentcheva and W. Römisch Stevens Institute of Technology, Hoboken Humboldt-University Berlin www.math.hu-berlin.de/~romisch SIAM
More informationMulti-armed bandit models: a tutorial
Multi-armed bandit models: a tutorial CERMICS seminar, March 30th, 2016 Multi-Armed Bandit model: general setting K arms: for a {1,..., K}, (X a,t ) t N is a stochastic process. (unknown distributions)
More informationConvex 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 informationarxiv: 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 informationPortfolio optimization with a copula-based extension of conditional value-at-risk
Ann Oper Res (2016) 237:219 236 DOI 10.1007/s10479-014-1625-3 Portfolio optimization with a copula-based extension of conditional value-at-risk Adam Krzemienowski Sylwia Szymczyk Published online: 26 May
More informationBest Guaranteed Result Principle and Decision Making in Operations with Stochastic Factors and Uncertainty
Stochastics and uncertainty underlie all the processes of the Universe. N.N.Moiseev Best Guaranteed Result Principle and Decision Making in Operations with Stochastic Factors and Uncertainty by Iouldouz
More informationNonlinear 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 informationStatistical Estimation: Data & Non-data Information
Statistical Estimation: Data & Non-data Information Roger J-B Wets University of California, Davis & M.Casey @ Raytheon G.Pflug @ U. Vienna, X. Dong @ EpiRisk, G-M You @ EpiRisk. a little background Decision
More informationBayesian Persuasion Online Appendix
Bayesian Persuasion Online Appendix Emir Kamenica and Matthew Gentzkow University of Chicago June 2010 1 Persuasion mechanisms In this paper we study a particular game where Sender chooses a signal π whose
More informationResearch 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 informationMinimax Problems. Daniel P. Palomar. Hong Kong University of Science and Technolgy (HKUST)
Mini Problems Daniel P. Palomar Hong Kong University of Science and Technolgy (HKUST) ELEC547 - Convex Optimization Fall 2009-10, HKUST, Hong Kong Outline of Lecture Introduction Matrix games Bilinear
More informationRobust Partially Observable Markov Decision Processes
Submitted to manuscript Robust Partially Observable Markov Decision Processes Mohammad Rasouli 1, Soroush Saghafian 2 1 Management Science and Engineering, Stanford University, Palo Alto, CA 2 Harvard
More informationA 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 informationRobust Dual-Response Optimization
Yanıkoğlu, den Hertog, and Kleijnen Robust Dual-Response Optimization 29 May 1 June 1 / 24 Robust Dual-Response Optimization İhsan Yanıkoğlu, Dick den Hertog, Jack P.C. Kleijnen Özyeğin University, İstanbul,
More informationminimize x x2 2 x 1x 2 x 1 subject to x 1 +2x 2 u 1 x 1 4x 2 u 2, 5x 1 +76x 2 1,
4 Duality 4.1 Numerical perturbation analysis example. Consider the quadratic program with variables x 1, x 2, and parameters u 1, u 2. minimize x 2 1 +2x2 2 x 1x 2 x 1 subject to x 1 +2x 2 u 1 x 1 4x
More informationGame Theory and its Applications to Networks - Part I: Strict Competition
Game Theory and its Applications to Networks - Part I: Strict Competition Corinne Touati Master ENS Lyon, Fall 200 What is Game Theory and what is it for? Definition (Roger Myerson, Game Theory, Analysis
More informationA remark on discontinuous games with asymmetric information and ambiguity
Econ Theory Bull DOI 10.1007/s40505-016-0100-5 RESEARCH ARTICLE A remark on discontinuous games with asymmetric information and ambiguity Wei He 1 Nicholas C. Yannelis 1 Received: 7 February 2016 / Accepted:
More informationOn Distributionally Robust Chance Constrained Program with Wasserstein Distance
On Distributionally Robust Chance Constrained Program with Wasserstein Distance Weijun Xie 1 1 Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA 4061 June 15, 018 Abstract
More informationAmbiguity Sets and their applications to SVM
Ambiguity Sets and their applications to SVM Ammon Washburn University of Arizona April 22, 2016 Ammon Washburn (University of Arizona) Ambiguity Sets April 22, 2016 1 / 25 Introduction Go over some (very
More informationDistributionally 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 informationMultivariate Stress Testing for Solvency
Multivariate Stress Testing for Solvency Alexander J. McNeil 1 1 Heriot-Watt University Edinburgh Vienna April 2012 a.j.mcneil@hw.ac.uk AJM Stress Testing 1 / 50 Regulation General Definition of Stress
More informationThe priority option: the value of being a leader in complete and incomplete markets.
s. a leader in s. Mathematics and Statistics - McMaster University Joint work with Vincent Leclère (École de Ponts) Eidgenössische Technische Hochschule Zürich, December 09, 2010 s. 1 2 3 4 s. Combining
More informationDynamic Discrete Choice Structural Models in Empirical IO
Dynamic Discrete Choice Structural Models in Empirical IO Lecture 4: Euler Equations and Finite Dependence in Dynamic Discrete Choice Models Victor Aguirregabiria (University of Toronto) Carlos III, Madrid
More informationReformulation 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 informationStochastic 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 informationGeneralized 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 informationComputational Game Theory Spring Semester, 2005/6. Lecturer: Yishay Mansour Scribe: Ilan Cohen, Natan Rubin, Ophir Bleiberg*
Computational Game Theory Spring Semester, 2005/6 Lecture 5: 2-Player Zero Sum Games Lecturer: Yishay Mansour Scribe: Ilan Cohen, Natan Rubin, Ophir Bleiberg* 1 5.1 2-Player Zero Sum Games In this lecture
More informationPlanning and Model Selection in Data Driven Markov models
Planning and Model Selection in Data Driven Markov models Shie Mannor Department of Electrical Engineering Technion Joint work with many people along the way: Dotan Di-Castro (Yahoo!), Assaf Halak (Technion),
More informationComplexity 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 informationMotivation 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 informationStochastic Programming: Basic Theory
Stochastic Programming: Basic Theory John R. Birge John.Birge@ChicagoBooth.edu www.chicagobooth.edu/fac/john.birge JRBirge ICSP, Bergamo, July 2013 1 Goals Provide background on the basics of stochastic
More informationHow much is information worth? A geometric insight using duality between payoffs and beliefs
How much is information worth? A geometric insight using duality between payoffs and beliefs Michel De Lara and Olivier Gossner CERMICS, École des Ponts ParisTech CNRS, X Paris Saclay and LSE Séminaire
More informationCourse Handouts ECON 4161/8001 MICROECONOMIC ANALYSIS. Jan Werner. University of Minnesota
Course Handouts ECON 4161/8001 MICROECONOMIC ANALYSIS Jan Werner University of Minnesota FALL SEMESTER 2017 1 PART I: Producer Theory 1. Production Set Production set is a subset Y of commodity space IR
More informationDistirbutional robustness, regularizing variance, and adversaries
Distirbutional robustness, regularizing variance, and adversaries John Duchi Based on joint work with Hongseok Namkoong and Aman Sinha Stanford University November 2017 Motivation We do not want machine-learned
More informationConvergence Analysis for Distributionally Robust Optimization and Equilibrium Problems*
MATHEMATICS OF OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxx 0000, pp. 000 000 issn 0364-765X eissn 1526-5471 00 0000 0001 INFORMS doi 10.1287/xxxx.0000.0000 c 0000 INFORMS Authors are encouraged to submit
More informationModels and Algorithms for Distributionally Robust Least Squares Problems
Models and Algorithms for Distributionally Robust Least Squares Problems Sanjay Mehrotra and He Zhang February 12, 2011 Abstract We present different robust frameworks using probabilistic ambiguity descriptions
More informationEE 227A: Convex Optimization and Applications April 24, 2008
EE 227A: Convex Optimization and Applications April 24, 2008 Lecture 24: Robust Optimization: Chance Constraints Lecturer: Laurent El Ghaoui Reading assignment: Chapter 2 of the book on Robust Optimization
More informationMultivariate Stress Scenarios and Solvency
Multivariate Stress Scenarios and Solvency Alexander J. McNeil 1 1 Heriot-Watt University Edinburgh Croatian Quants Day Zagreb 11th May 2012 a.j.mcneil@hw.ac.uk AJM Stress Testing 1 / 51 Regulation General
More informationDistributionally 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 informationCS229T/STATS231: Statistical Learning Theory. Lecturer: Tengyu Ma Lecture 11 Scribe: Jongho Kim, Jamie Kang October 29th, 2018
CS229T/STATS231: Statistical Learning Theory Lecturer: Tengyu Ma Lecture 11 Scribe: Jongho Kim, Jamie Kang October 29th, 2018 1 Overview This lecture mainly covers Recall the statistical theory of GANs
More informationECOM 009 Macroeconomics B. Lecture 2
ECOM 009 Macroeconomics B Lecture 2 Giulio Fella c Giulio Fella, 2014 ECOM 009 Macroeconomics B - Lecture 2 40/197 Aim of consumption theory Consumption theory aims at explaining consumption/saving decisions
More informationSequential Investment, Universal Portfolio Algos and Log-loss
1/37 Sequential Investment, Universal Portfolio Algos and Log-loss Chaitanya Ryali, ECE UCSD March 3, 2014 Table of contents 2/37 1 2 3 4 Definitions and Notations 3/37 A market vector x = {x 1,x 2,...,x
More informationDepartment 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