|
|
Hurdle models in non-life insurance
Tian, Cheng ; Pešta, Michal (advisor) ; Branda, Martin (referee)
A number of articles only present hurdle models for count data. we are motivated to present hurdle models for semi-continuous data. Because semi- continuous data is also commonly seen in non-life insurance. The thesis deals with the parameterization of various hurdle models for semi-continuous data besides for count data in non-life insurance. Two components of a hurdle model are modeled separately. A hurdle component is modeled by a logistic regression. For a semi-continuous data, a continuous component is modeled by several various regressions. Parameters of each component are estimated through maximum likelihood estimation. Model selection is mentioned before theoretical approaches are applied on the vehicle insurance data. Finally, we get some predicted values based on the fitted models. The prediction gives insurance companies a general idea on setting premium but not accurate. 1
|
|
|
Bilevel optimization problems and their applications to portfolio selection
Goduľová, Lenka ; Kopa, Miloš (advisor) ; Branda, Martin (referee)
Title: Bilevel optimization problems and their applications to portfolio selection Author: Lenka Godul'ová Department of Probability and Mathematical Statistics Supervisor: doc. RNDr. Ing. Miloš Kopa, Ph.D. Abstract: This work deals with the problem of bilevel tasks. First, it recalls the basic knowledge of mean-risk models, risk measure in singlelevel problems, and second degree stochastic dominance. Then it presents basic knowledge of bilevel tasks. bilevel problems have several advantages over singlelevel. In one process, it is possible to analyze two different or even conflicting situations. The bilevel role can better capture the relationship between the two objects. The main focus of the thesis is the formulation of various bilevel tasks and their reformulation into the simplest form. The numerical part deals with four types of formulated bilevel problems at selected risk measures. Keywords: Bilevel problems, Second degree stochastic dominance, Risk measures 1
|
|
|
Image of Spain and Portugal in English written travelogues in 1750'
Branda, Martin ; Křížová, Markéta (advisor) ; Černá, Jana (referee) ; Erdösi, Péter (referee)
in English The master thesis is concerned with the analysis and interpretation of English written travelogues of the second half of the 18th century, which described Spain and Portugal. I work with two original texts and one translation from Italian, all texts were popular among their readers. The main goal of the thesis is to create the complex image of both respective countries and their inhabitants, based on the analysis of travelogues. As the fundamental concept of the thesis, I use so-called Black Legend, the negative view of the Iberian Peninsula originating in the 16th century. At the same time, the aim of the thesis is to compare the images in all works and come to more general conclusions about English perception of Spain and Portugal. Keywords: Spain, Portugal, travelogues, image of the Other, Black Legend, Southey, Baretti, Young
|
|
|
Optimization of reinsurace parameters in insurance
Dlouhá, Veronika ; Branda, Martin (advisor) ; Cipra, Tomáš (referee)
This thesis is dedicated to searching optimal parameters of reinsurance with a focus of quota-share and stop-loss reinsurance. The optimization is based on minimization of value at risk and conditional value at risk of total costs of the insurer for the recieved risk. It also presents a compound random variable and shows various methods of obtaining its probability distribution, for example ap- proximation by lognormal or gamma mixtures distributions or by Panjer recurive method for continuous severity and numerical method of its solution. At the end of the thesis we can find the calculation of the optimal parameters of reinsurance for a compound random variable based on real data. We use various methods to determine probability distribution and premiums. 1
|
|
|
Fixed interval scheduling problems - stochastic extensions, formulations and algortihms
Leder, Ondřej ; Branda, Martin (advisor) ; Kopa, Miloš (referee)
Fixed interval scheduling problems have wide range of practical use in production planning, transportation, in hospitals or in schools when planning timetables. When solving these problems we often encounter requirement of integrality of solutions. Ignoring this condition is often not possible. In this thesis we propose some formulations of scheduling problems and their stochastic extensions. We also propone a new formulation of stochastic FIS problem, for which integrality of solution is byproduct of its definition. We present Gâteaux derivative and its relationship to stability of optimal value function of stochastic optimization problems under the influence of contamination. We propose a new theorem on the stability of such functions for fixed interval scheduling problems.
|
|
|
Stochastic Optimization on Random Networks
Sigačevová, Jana ; Houda, Michal (advisor) ; Branda, Martin (referee)
The deterministic theory of graphs and networks is used successfully in cases where no random component is needed. However in practice, a number of decision-making and conflict situations require the inclusion of a stochastic element directly into the model. The objective of this thesis is the introduction of stochastic optimization and its application on random networks. The reader will become familiar with three approaches to stochastic optimization. Namely two-stage optimization, multi-stage optimization and chance constraint optimization. Finally, the studied issue is demonstrated on a real telecommunication network example.
|
|
|
Scheduling optimization problems in education
Puček, Samuel ; Kopa, Miloš (advisor) ; Branda, Martin (referee)
This work deals with the theory of integer programming. After defining the ba- sic concepts, it presents two algorithms suitable for solving integer problems. Firstly, it talks about the branch and bound algorithm and secondly, it talks about the cutting plane algorithm. Next, it presents an assignment problem, which is a special case of integer programming. The work describes the hungarian method and explains its usage on exemplary examples. The last part of the work solves the real problem from the practice. The aim of this section is to find an optimal schedule for classes one to seven of the selected elementary school. It introduces input data processing, creating a model and the solution. Obtained results are accompanied by a brief discussion. 1
|
|
|
Scenario reduction in Monte Carlo methods in optimization
Trégner, Tomáš ; Kopa, Miloš (advisor) ; Branda, Martin (referee)
Tato práce se zabývá redukcí scénáøù pøi pou¾ití Monte Carlo metod. Hlavním cílem je posoudit, jaké výhody, èi zlep¹ení nám mù¾e redukce scénáøù poskytnout a zda nám mù¾e být v praxi u¾iteèná. V práci budeme prezentovat výsledky zís- kané pomocí vlastní implementace redukèního algoritmu v jazyku Python. Pro úèely posouzení efektivity redukce scénáøù byly vybrány dva konkrétní problémy. Prvním z nich je odhad konstanty π, který je pro tento úèel vhodný zejména proto, ¾e je znám pøesný výsledek. Druhým problém, na který se soustøedíme, je pak výbìr optimálního portfolia z daných akcií, který jsme vybrali proto, ¾e se jedná o pomìrnì nároèný a zajímavý problém umo¾òující posoudit èasovou efek- tivitu metody redukce scénáøù. Na základì na¹ich výpoètù docházíme k závìru, ¾e redukce scénáøù mù¾e být u¾iteèným nástrojem pro slo¾ité úlohy, je v¹ak tøeba si dávat pozor na vhodnou volbu pou¾ité metriky. 1
|
|
|
Basic approaches to robust conditional value at risk
Nožička, Michal ; Branda, Martin (advisor) ; Petrová, Barbora (referee)
The work describes conditional value at risk, its robustification with respect to the probability distribution of yields of assets and its applications to optimal portfolio selection. In chapter one there are definitions of conditional value at risk and its generalization throught robustification and also motivation to these definitions. The basic properties of conditional value at risk, mainly coherence and continuity with respect to the parametr of confidence level, are discussed in chapter two. There is also shown that some of these properties are preserved after robustification. The third chapter is dedicated to the derivation of optimization problems of optimal portfolio selection on the basis of conditional value at risk and its robustification. This thesis describes only special cases so that the final problems are solveble by the means of linear programming. The fourth chapter describes particular utilization of these methods with usage of real data from financial markets. Powered by TCPDF (www.tcpdf.org)
|
|
|
Robust methods in portfolio theory
Petrušová, Lucia ; Branda, Martin (advisor) ; Večeř, Jan (referee)
01 Abstract: This thesis is concerned with the robust methods in portfolio theory. Different risk measures used in portfolio management are introduced and the corresponding robust portfolio optimization problems are formulated. The analytical solutions of the robust portfolio optimization problem with the lower partial moments (LPM), value-at-risk (VaR) or conditional value-at-risk (CVaR), as a risk measure, are presented. The application of the worst-case conditional value-at-risk (WCVaR) to robust portfolio management is proposed. This thesis considers WCVaR in the situation where only partial information on the underlying probability distribution is available. The minimization of WCVaR under mixture distribution uncertainty, box uncertainty, and ellipsoidal uncertainty are investigated. Several numerical examples based on real market data are presented to illustrate the proposed approaches and advantage of the robust formulation over the corresponding nominal approach.
|
guest ::
