Finanční aplikace podmíněných očekávání

Import 14/02/2017This dissertation examines different financial applications of some conditional expectation estimators. In the first application, we provide some theoretical motivations behind the use of the moving average rule as one of the most popular trading tools among practitioners. In particular, we examine the conditional probability of the price increments and we study how this probability changes over time. In the second application, we present different approaches to evaluate the presence of the arbitrage opportunities in the option market. In particular, we investigate empirically the well-known put-call parity no-arbitrage relation and the state price density. We first measure the violation of the put-call parity as the difference in implied volatilities between call and put options. Furthermore, we propose alternative approaches to estimate the state price density under the classical hypothesis of the Black and Scholes model. In the third application, we investigate the implications for portfolio theory of using conditional expectation estimators. First, we focus on the approximation of the conditional expectation within large-scale portfolio selection problems. In this context, we propose a new consistent multivariate kernel estimator to approximate the conditional expectation. We show how the new estimator can be used for the return approximation of large-scale portfolio problems. Moreover, the proposed estimator optimizes the bandwidth selection of kernel type estimators, solving the classical selection problem. Second, we propose new performance measures based on the conditional expectation that takes into account the heavy tails of the return distributions. Third, we deal with the portfolio selection problem from the point of view of different non-satiable investors, namely risk-averse and risk-seeking investors. In particular, using a well-known ordering classification, we first identify different definitions of returns based on the investors’ preferences. The new definitions of returns are based on the conditional expected value between the random wealth assessed at different times. Finally, for each problem, we propose an empirical application of several admissible portfolio optimization problems using the US stock market.154 - Katedra financívyhově

Problem-driven scenario generation: an analytical approach for stochastic programs with tail risk measure

Scenario generation is the construction of a discrete random vector to represent parameters of uncertain values in a stochastic program. Most approaches to scenario generation are distribution-driven, that is, they attempt to construct a random vector which captures well in a probabilistic sense the uncertainty. On the other hand, a problem-driven approach may be able to exploit the structure of a problem to provide a more concise representation of the uncertainty. In this paper we propose an analytic approach to problem-driven scenario generation. This approach applies to stochastic programs where a tail risk measure, such as conditional value-at-risk, is applied to a loss function. Since tail risk measures only depend on the upper tail of a distribution, standard methods of scenario generation, which typically spread their scenarios evenly across the support of the random vector, struggle to adequately represent tail risk. Our scenario generation approach works by targeting the construction of scenarios in areas of the distribution corresponding to the tails of the loss distributions. We provide conditions under which our approach is consistent with sampling, and as proof-of-concept demonstrate how our approach could be applied to two classes of problem, namely network design and portfolio selection. Numerical tests on the portfolio selection problem demonstrate that our approach yields better and more stable solutions compared to standard Monte Carlo sampling

Mean-Variance Policy for Discrete-time Cone Constrained Markets: The Consistency in Efficiency and Minimum-Variance Signed Supermartingale Measure

The discrete-time mean-variance portfolio selection formulation, a representative of general dynamic mean-risk portfolio selection problems, does not satisfy time consistency in efficiency (TCIE) in general, i.e., a truncated pre-committed efficient policy may become inefficient when considering the corresponding truncated problem, thus stimulating investors' irrational investment behavior. We investigate analytically effects of portfolio constraints on time consistency of efficiency for convex cone constrained markets. More specifically, we derive the semi-analytical expressions for the pre-committed efficient mean-variance policy and the minimum-variance signed supermartingale measure (VSSM) and reveal their close relationship. Our analysis shows that the pre-committed discrete-time efficient mean-variance policy satisfies TCIE if and only if the conditional expectation of VSSM's density (with respect to the original probability measure) is nonnegative, or once the conditional expectation becomes negative, it remains at the same negative value until the terminal time. Our findings indicate that the property of time consistency in efficiency only depends on the basic market setting, including portfolio constraints, and this fact motivates us to establish a general solution framework in constructing TCIE dynamic portfolio selection problem formulations by introducing suitable portfolio constraints

A Simulation Approach to Dynamic Portfolio Choice with an Application to Learning About Return Predictability

We present a simulation-based method for solving discrete-time portfolio choice problems involving non-standard preferences, a large number of assets with arbitrary return distribution, and, most importantly, a large number of state variables with potentially path-dependent or non-stationary dynamics. The method is flexible enough to accommodate intermediate consumption, portfolio constraints, parameter and model uncertainty, and learning. We first establish the properties of the method for the portfolio choice between a stock index and cash when the stock returns are either iid or predictable by the dividend yield. We then explore the problem of an investor who takes into account the predictability of returns but is uncertain about the parameters of the data generating process. The investor chooses the portfolio anticipating that future data realizations will contain useful information to learn about the true parameter values.

Processing second-order stochastic dominance models using cutting-plane representations

This is the post-print version of the Article. The official published version can be accessed from the links below. Copyright @ 2011 Springer-VerlagSecond-order stochastic dominance (SSD) is widely recognised as an important decision criterion in portfolio selection. Unfortunately, stochastic dominance models are known to be very demanding from a computational point of view. In this paper we consider two classes of models which use SSD as a choice criterion. The first, proposed by Dentcheva and Ruszczyński (J Bank Finance 30:433–451, 2006), uses a SSD constraint, which can be expressed as integrated chance constraints (ICCs). The second, proposed by Roman et al. (Math Program, Ser B 108:541–569, 2006) uses SSD through a multi-objective formulation with CVaR objectives. Cutting plane representations and algorithms were proposed by Klein Haneveld and Van der Vlerk (Comput Manage Sci 3:245–269, 2006) for ICCs, and by Künzi-Bay and Mayer (Comput Manage Sci 3:3–27, 2006) for CVaR minimization. These concepts are taken into consideration to propose representations and solution methods for the above class of SSD based models. We describe a cutting plane based solution algorithm and outline implementation details. A computational study is presented, which demonstrates the effectiveness and the scale-up properties of the solution algorithm, as applied to the SSD model of Roman et al. (Math Program, Ser B 108:541–569, 2006).This study was funded by OTKA, Hungarian National Fund for Scientific Research, project 47340; by Mobile Innovation Centre, Budapest University of Technology, project 2.2; Optirisk Systems, Uxbridge, UK and by BRIEF (Brunel University Research Innovation and Enterprise Fund)