• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 87
  • 11
  • 6
  • 5
  • 5
  • 5
  • 4
  • 3
  • 3
  • 2
  • 1
  • 1
  • Tagged with
  • 142
  • 142
  • 59
  • 43
  • 22
  • 21
  • 21
  • 19
  • 18
  • 18
  • 17
  • 16
  • 16
  • 16
  • 16
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
131

Essays in financial mathematics

Lindensjö, Kristoffer January 2013 (has links)
<p>Diss. Stockholm : Handelshögskolan, 2013. Sammanfattning jämte 3 uppsatser.</p>
132

薪資所得與通貨膨脹不確定性於確定提撥退休金計畫 / Hedging Labor Income Inflation Uncertainties through Capital Market in Defined Contribution Pension Schemes

黃雅文, Hwang Ya-wen Unknown Date (has links)
本文於確定提撥退休金制度下,探討基金經理人如何決定最適資產策略規避薪資所得及通貨膨脹之不確定風險,求得期末財富效用期望值極大化。本研究首先擴展Battocchio與Menoncin (2004)所建構之資產模型,我們不僅探討來自市場之風險,同時考量薪資所得、通貨膨脹與費用率之不確定性,研究其對最適資產配置行為的影響,建構隨機控制模型,以動態規劃方法求解Hamiltonian方程式,研究結果顯示,我們可利用五項共同基金分離定理來描述投資人之最適投資決策:短期市場基金、狀態變數避險基金、薪資所得避險基金、通貨膨脹避險基金與現金部位。數值結果顯示,股票持有部位中通貨膨脹避險基金佔有最大的成份,債券持有部位中通貨膨脹避險基金與狀態變數避險基金佔有最大的成份。 關鍵字:確定提撥、薪資的不確定性、通貨膨脹、隨機控制、動態規劃 / In this study, we investigate the portfolio selection problem in order to hedge the labor income and inflation uncertainties for defined contribution (DC) pension schemes. First, we extend the previous work of Battocchio and Menoncin (2004) that allowed the state variables (i.e., the risks from the financial market) and a set of stochastic processes to describe the inflation, labor income and expense uncertainties. A five-fund separation theorem is derived to characterize the optimal investment strategy for DC pension plans to hedge the labor income and the inflation risks. Second, by solving the Hamiltonian equation in the three-asset framework, we show that the optimal portfolio consists of five components: the myopic market portfolio, the hedge portfolio for the state variables, the hedge portfolio for the inflation risk, the hedge portfolio for the labor income uncertainty and the riskless asset. Then we explicitly solve the optimal portfolio problem. Finally, the numerical results indicate that the inflation hedge portfolio comprises the overwhelming proportion of stock holdings in the optimal portfolios. In addition, the inflation hedge portfolio and the state variable hedge portfolio constitute the overwhelming proportions of bond holdings. Keywords: defined contribution; salary uncertainty; inflation; stochastic control; dynamic programming.
133

Stabilisation des systèmes quantiques à temps discrets et stabilité des filtres quantiques à temps continus / Stabilization of discrete-time quantum systems and stability of continuous-time quantum filters

Amini, Hadis 27 September 2012 (has links)
Dans cette thèse, nous étudions des rétroactions visant à stabiliser des systèmes quantiques en temps discret soumis à des mesures quantiques non-destructives (QND), ainsi que la stabilité des filtres quantiques à temps continu. Cette thèse comporte deux parties. Dans une première partie, nous généralisons les méthodes mathématiques sous-jacentes à une rétroaction quantique en temps discret testée expérimentalement au Laboratoire Kastler Brossel (LKB) de l'École Normale Supérieure (ENS) de Paris. Plus précisément,nous contribuons à un algorithme de contrôle qui a été utilisé lors de cette expérience récente de rétroaction quantique. L'expérience consiste en la préparation et la stabilisation à la demande d'états nombres de photons (états de Fock) d'un champ de micro-ondes au sein d'une cavité supraconductrice. Pour cela, nous concevons des filtres à temps-réel permettant d'estimer les états quantiques malgré des imperfections et des retards de mesure, et nous proposons une loi de rétroaction assurant la stabilisation d'un état cible prédéterminé. Cette rétroaction de stabilisation est obtenue grâce à des méthodes Lyapunov stochastique et elle repose sur un filtre estimant l'état quantique. Nous prouvons qu'une telle stratégie de contrôle se généralise à d'autres systèmes quantiques en temps discret soumis à des mesures QND. Dans une seconde partie, nous considérons une extension du résultat obtenu pour des filtres quantiques en temps discret au cas des filtres en temps continu. Dans ce but, nous démontrons la stabilité d'un filtre quantique associé à l'équation maîtresse stochastique usuelle découlant par un processus de Wiener. La stabilité signifie ici que la “distance”entre l'état physique et le filtre quantique associé décroit en moyenne. Cette partie étudie également la conception d'un filtre optimal en temps continu en présence d'imperfections de mesure. Pour ce faire, nous étendons la méthode utilisée précédemment pour construire les filtres quantiques en temps discret tolérants aux imperfections de mesure. Enfin,nous obtenons heuristiquement des filtres optimaux généraux en temps continu, dont la dynamique est décrite par des équations maîtresses stochastiques découlant à la fois par processus de Poisson et Wiener. Nous conjecturons que ces filtres optimaux sont stables. / In this thesis, we study measurement-based feedbacks stabilizing discrete-time quantum systems subject to quantum non-demolition (QND) measurements and stability of continuous-time quantum filters. This thesis contains two parts. In the first part, we generalize the mathematical methods underlying a discrete-time quantum feedback experimentally tested in Laboratoire Kastler Brossel (LKB) at Ecole Normale Supérieure (ENS) de Paris. In fact, we contribute to a control algorithm which has been used in this recent quantum feedback experiment. This experiment prepares and stabilizes on demand photon-number states (Fock states) of a microwave field in a superconducting cavity. We design real-time filters allowing estimation of the state despite measurement imperfections and delays, and we propose a feedback law which ensures the stabilization of a predetermined target state. This stabilizing feedback is obtained by stochastic Lyapunov techniques and depends on a filter estimating the quantum state. We prove that such control strategy extends to other discrete-time quantum systems under QND measurements. The second part considers an extension, to continuous-time, of a stability result for discrete-time quantum filters. Indeed, we prove the stability of a quantum filter associated to usual stochastic master equation driven by a Wiener process. This stability means that a “distance” between the physical state and its associated quantum filter decreases in average. Another subject that we study in this part is related to the design of a continuous-time optimal filter, in the presence of measurement imperfections. To this aim, we extend a construction method for discrete-time quantum filters with measurement imperfections. Finally, we obtain heuristically generalized continuous-time optimal filters whose dynamics are given by stochastic master equations driven by both Poisson and Wiener processes. We conjecture the stability of such optimal filters.
134

Algorithms for Product Pricing and Energy Allocation in Energy Harvesting Sensor Networks

Sindhu, P R January 2014 (has links) (PDF)
In this thesis, we consider stochastic systems which arise in different real-world application contexts. The first problem we consider is based on product adoption and pricing. A monopolist selling a product has to appropriately price the product over time in order to maximize the aggregated profit. The demand for a product is uncertain and is influenced by a number of factors, some of which are price, advertising, and product technology. We study the influence of price on the demand of a product and also how demand affects future prices. Our approach involves mathematically modelling the variation in demand as a function of price and current sales. We present a simulation-based algorithm for computing the optimal price path of a product for a given period of time. The algorithm we propose uses a smoothed-functional based performance gradient descent method to find a price sequence which maximizes the total profit over a planning horizon. The second system we consider is in the domain of sensor networks. A sensor network is a collection of autonomous nodes, each of which senses the environment. Sensor nodes use energy for sensing and communication related tasks. We consider the problem of finding optimal energy sharing policies that maximize the network performance of a system comprising of multiple sensor nodes and a single energy harvesting(EH) source. Nodes periodically sense a random field and generate data, which is stored in their respective data queues. The EH source harnesses energy from ambient energy sources and the generated energy is stored in a buffer. The nodes require energy for transmission of data and and they receive the energy for this purpose from the EH source. There is a need for efficiently sharing the stored energy in the EH source among the nodes in the system, in order to minimize average delay of data transmission over the long run. We formulate this problem in the framework of average cost infinite-horizon Markov Decision Processes[3],[7]and provide algorithms for the same.
135

Optimal prediction games in local electricity markets

Martyr, Randall January 2015 (has links)
Local electricity markets can be defined broadly as 'future electricity market designs involving domestic customers, demand-side response and energy storage'. Like current deregulated electricity markets, these localised derivations present specific stochastic optimisation problems in which the dynamic and random nature of the market is intertwined with the physical needs of its participants. Moreover, the types of contracts and constraints in this setting are such that 'games' naturally emerge between the agents. Advanced modelling techniques beyond classical mathematical finance are therefore key to their analysis. This thesis aims to study contracts in these local electricity markets using the mathematical theories of stochastic optimal control and games. Chapter 1 motivates the research, provides an overview of the electricity market in Great Britain, and summarises the content of this thesis. It introduces three problems which are studied later in the thesis: a simple control problem involving demand-side management for domestic customers, and two examples of games within local electricity markets, one of them involving energy storage. Chapter 2 then reviews the literature most relevant to the topics discussed in this work. Chapter 3 investigates how electric space heating loads can be made responsive to time varying prices in an electricity spot market. The problem is formulated mathematically within the framework of deterministic optimal control, and is analysed using methods such as Pontryagin's Maximum Principle and Dynamic Programming. Numerical simulations are provided to illustrate how the control strategies perform on real market data. The problem of Chapter 3 is reformulated in Chapter 4 as one of optimal switching in discrete-time. A martingale approach is used to establish the existence of an optimal strategy in a very general setup, and also provides an algorithm for computing the value function and the optimal strategy. The theory is exemplified by a numerical example for the motivating problem. Chapter 5 then continues the study of finite horizon optimal switching problems, but in continuous time. It also uses martingale methods to prove the existence of an optimal strategy in a fairly general model. Chapter 6 introduces a mathematical model for a game contingent claim between an electricity supplier and generator described in the introduction. A theory for using optimal switching to solve such games is developed and subsequently evidenced by a numerical example. An optimal switching formulation of the aforementioned game contingent claim is provided for an abstract Markovian model of the electricity market. The final chapter studies a balancing services contract between an electricity transmission system operator (SO) and the owner of an electric energy storage device (battery operator or BO). The objectives of the SO and BO are combined in a non-zero sum stochastic differential game where one player (BO) uses a classic control with continuous effects, whereas the other player (SO) uses an impulse control (discontinuous effects). A verification theorem proving the existence of Nash equilibria in this game is obtained by recursion on the solutions to Hamilton-Jacobi-Bellman variational PDEs associated with non-zero sum controller-stopper games.
136

Modélisation stochastique des marchés financiers et optimisation de portefeuille / Stochastic modeling of financial markets and portfolio optimization

Bonelli, Maxime 08 September 2016 (has links)
Cette thèse présente trois contributions indépendantes. La première partie se concentre sur la modélisation de la moyenne conditionnelle des rendements du marché actions : le rendement espéré du marché. Ce dernier est souvent modélisé à l'aide d'un processus AR(1). Cependant, des études montrent que lors de mauvaises périodes économiques la prédictibilité des rendements est plus élevée. Etant donné que le modèle AR(1) exclut par construction cette propriété, nous proposons d'utiliser un modèle CIR. Les implications sont étudiées dans le cadre d'un modèle espace-état bayésien. La deuxième partie est dédiée à la modélisation de la volatilité des actions et des volumes de transaction. La relation entre ces deux quantités a été justifiée par l'hypothèse de mélange de distribution (MDH). Cependant, cette dernière ne capture pas la persistance de la variance, à la différence des spécifications GARCH. Nous proposons un modèle à deux facteurs combinant les deux approches, afin de dissocier les variations de volatilité court terme et long terme. Le modèle révèle plusieurs régularités importantes sur la relation volume-volatilité. La troisième partie s'intéresse à l'analyse des stratégies d'investissement optimales sous contrainte «drawdown ». Le problème étudié est celui de la maximisation d'utilité à horizon fini pour différentes fonctions d'utilité. Nous calculons les stratégies optimales en résolvant numériquement l'équation de Hamilton-Jacobi-Bellman, qui caractérise le principe de programmation dynamique correspondant. En se basant sur un large panel d'expérimentations numériques, nous analysons les divergences des allocations optimales / This PhD thesis presents three independent contributions. The first part is concentrated on the modeling of the conditional mean of stock market returns: the expected market return. The latter is often modeled as an AR(1) process. However, empirical studies have found that during bad times return predictability is higher. Given that the AR(1) model excludes by construction this property, we propose to use instead a CIR model. The implications of this specification are studied within a flexible Bayesian state-space model. The second part is dedicated to the modeling of stocks volatility and trading volume. The empirical relationship between these two quantities has been justified by the Mixture of Distribution Hypothesis (MDH). However, this framework notably fails to capture the obvious persistence in stock variance, unlike GARCH specifications. We propose a two-factor model of volatility combining both approaches, in order to disentangle short-run from long-run volatility variations. The model reveals several important regularities on the volume-volatility relationship. The third part of the thesis is concerned with the analysis of optimal investment strategies under the drawdown constraint. The finite horizon expectation maximization problem is studied for different types of utility functions. We compute the optimal investments strategies, by solving numerically the Hamilton–Jacobi–Bellman equation, that characterizes the dynamic programming principle related to the stochastic control problem. Based on a large panel of numerical experiments, we analyze the divergences of optimal allocation programs
137

Information diffusion and opinion dynamics in social networks / Dissémination de l’information et dynamique des opinions dans les réseaux sociaux

Louzada Pinto, Julio Cesar 14 January 2016 (has links)
La dissémination d'information explore les chemins pris par l'information qui est transmise dans un réseau social, afin de comprendre et modéliser les relations entre les utilisateurs de ce réseau, ce qui permet une meilleur compréhension des relations humaines et leurs dynamique. Même si la priorité de ce travail soit théorique, en envisageant des aspects psychologiques et sociologiques des réseaux sociaux, les modèles de dissémination d'information sont aussi à la base de plusieurs applications concrètes, comme la maximisation d'influence, la prédication de liens, la découverte des noeuds influents, la détection des communautés, la détection des tendances, etc. Cette thèse est donc basée sur ces deux facettes de la dissémination d'information: nous développons d'abord des cadres théoriques mathématiquement solides pour étudier les relations entre les personnes et l'information, et dans un deuxième moment nous créons des outils responsables pour une exploration plus cohérente des liens cachés dans ces relations. Les outils théoriques développés ici sont les modèles de dynamique d'opinions et de dissémination d'information, où nous étudions le flot d'informations des utilisateurs dans les réseaux sociaux, et les outils pratiques développés ici sont un nouveau algorithme de détection de communautés et un nouveau algorithme de détection de tendances dans les réseaux sociaux / Our aim in this Ph. D. thesis is to study the diffusion of information as well as the opinion dynamics of users in social networks. Information diffusion models explore the paths taken by information being transmitted through a social network in order to understand and analyze the relationships between users in such network, leading to a better comprehension of human relations and dynamics. This thesis is based on both sides of information diffusion: first by developing mathematical theories and models to study the relationships between people and information, and in a second time by creating tools to better exploit the hidden patterns in these relationships. The theoretical tools developed in this thesis are opinion dynamics models and information diffusion models, where we study the information flow from users in social networks, and the practical tools developed in this thesis are a novel community detection algorithm and a novel trend detection algorithm. We start by introducing an opinion dynamics model in which agents interact with each other about several distinct opinions/contents. In our framework, agents do not exchange all their opinions with each other, they communicate about randomly chosen opinions at each time. We show, using stochastic approximation algorithms, that under mild assumptions this opinion dynamics algorithm converges as time increases, whose behavior is ruled by how users choose the opinions to broadcast at each time. We develop next a community detection algorithm which is a direct application of this opinion dynamics model: when agents broadcast the content they appreciate the most. Communities are thus formed, where they are defined as groups of users that appreciate mostly the same content. This algorithm, which is distributed by nature, has the remarkable property that the discovered communities can be studied from a solid mathematical standpoint. In addition to the theoretical advantage over heuristic community detection methods, the presented algorithm is able to accommodate weighted networks, parametric and nonparametric versions, with the discovery of overlapping communities a byproduct with no mathematical overhead. In a second part, we define a general framework to model information diffusion in social networks. The proposed framework takes into consideration not only the hidden interactions between users, but as well the interactions between contents and multiple social networks. It also accommodates dynamic networks and various temporal effects of the diffusion. This framework can be combined with topic modeling, for which several estimation techniques are derived, which are based on nonnegative tensor factorization techniques. Together with a dimensionality reduction argument, this techniques discover, in addition, the latent community structure of the users in the social networks. At last, we use one instance of the previous framework to develop a trend detection algorithm designed to find trendy topics in a social network. We take into consideration the interaction between users and topics, we formally define trendiness and derive trend indices for each topic being disseminated in the social network. These indices take into consideration the distance between the real broadcast intensity and the maximum expected broadcast intensity and the social network topology. The proposed trend detection algorithm uses stochastic control techniques in order calculate the trend indices, is fast and aggregates all the information of the broadcasts into a simple one-dimensional process, thus reducing its complexity and the quantity of necessary data to the detection. To the best of our knowledge, this is the first trend detection algorithm that is based solely on the individual performances of topics
138

Single and Multi-player Stochastic Dynamic Optimization

Saha, Subhamay January 2013 (has links) (PDF)
In this thesis we investigate single and multi-player stochastic dynamic optimization prob-lems. We consider both discrete and continuous time processes. In the multi-player setup we investigate zero-sum games with both complete and partial information. We study partially observable stochastic games with average cost criterion and the state process be-ing discrete time controlled Markov chain. The idea involved in studying this problem is to replace the original unobservable state variable with a suitable completely observable state variable. We establish the existence of the value of the game and also obtain optimal strategies for both players. We also study a continuous time zero-sum stochastic game with complete observation. In this case the state is a pure jump Markov process. We investigate the nite horizon total cost criterion. We characterise the value function via appropriate Isaacs equations. This also yields optimal Markov strategies for both players. In the single player setup we investigate risk-sensitive control of continuous time Markov chains. We consider both nite and in nite horizon problems. For the nite horizon total cost problem and the in nite horizon discounted cost problem we characterise the value function as the unique solution of appropriate Hamilton Jacobi Bellman equations. We also derive optimal Markov controls in both the cases. For the in nite horizon average cost case we shown the existence of an optimal stationary control. we also give a value iteration scheme for computing the optimal control in the case of nite state and action spaces. Further we introduce a new class of stochastic processes which we call stochastic processes with \age-dependent transition rates". We give a rigorous construction of the process. We prove that under certain assunptions the process is Feller. We also compute the limiting probabilities for our process. We then study the controlled version of the above process. In this case we take the risk-neutral cost criterion. We solve the in nite horizon discounted cost problem and the average cost problem for this process. The crucial step in analysing these problems is to prove that the original control problem is equivalent to an appropriate semi-Markov decision problem. Then the value functions and optimal controls are characterised using this equivalence and the theory of semi-Markov decision processes (SMDP). The analysis of nite horizon problems becomes di erent from that of in nite horizon problems because of the fact that in this case the idea of converting into an equivalent SMDP does not seem to work. So we deal with the nite horizon total cost problem by showing that our problem is equivalent to another appropriately de ned discrete time Markov decision problem. This allows us to characterise the value function and to nd an optimal Markov control.
139

Stochastic Fluctuations in Endoreversible Systems

Schwalbe, Karsten 20 February 2017 (has links) (PDF)
In dieser Arbeit wird erstmalig der Einfluss stochastischer Schwankungen auf endoreversible Modelle untersucht. Hierfür wird die Novikov-Maschine mit drei verschieden Wärmetransportgesetzen (Newton, Fourier, asymmetrisch) betrachtet. Während die maximale verrichtete Arbeit und der dazugehörige Wirkungsgrad recht einfach im Falle konstanter Wärmebadtemperaturen hergeleitet werden können, ändern sich dies, falls die Temperaturen stochastisch fluktuieren können. Im letzteren Fall muss die stochastische optimale Kontrolltheorie genutzt werden, um das Maximum der zu erwartenden Arbeit und die dazugehörige Kontrollstrategie zu ermitteln. Im Allgemeinen kann die Lösung derartiger Probleme auf eine nichtlineare, partielle Differentialgleichung, welche an eine Optimierung gekoppelt ist, zurückgeführt werden. Diese Gleichung wird stochastische Hamilton-Jacobi-Bellman-Gleichung genannt. Allerdings können, wie in dieser Arbeit dargestellt, die Berechnungen vereinfacht werden, wenn man annimmt, dass die Fluktuationen unabhängig von der betrachteten Kontrollvariablen sind. In diesem Fall zeigen analytische Betrachtungen, dass die Gleichungen für die verrichtete Arbeit and den Wirkungsgrad ihre ursprüngliche Form behalten, aber manche Terme müssen durch entsprechende Zeitmittel bzw. Erwartungswerte ersetzt werden, jeweils abhängig von der betrachteten Art der Kontrolle. Basierend auf einer Analyse der Leistungsparameter im Falle einer Gleichverteilung der heißen Temperatur der Novikov-Maschine können Schlussfolgerungen auf deren Monotonieverhalten gezogen werden. Der Vergleich verschiedener, zeitunabhängiger, symmetrischer Verteilungen führt zu einer bis dato unbekannten Erweiterung des Curzon-Ahlborn-Wirkungsgrades im Falle kleiner Schwankungen. Weiterhin wird eine Analyse einer Novikov-Maschine mit asymmetrischen Wärmetransport, bei der das Verhalten der heißen Temperatur durch einen Ornstein-Uhlenbeck-Prozess beschrieben wird, durchgeführt. Abschließend wird eine Novikov-Maschine mit Fourierscher Wärmeleitung, bei der die Dynamik der heißen Temperatur von der Kontrollvariable abhängt, betrachtet. Durch das Lösen der Hamilton-Jacobi-Bellman-Gleichung können neuartige Schlussfolgerungen gezogen werden, wie derartige Systeme optimal zu steuern sind. / In this thesis, the influence of stochastic fluctuations on the performance of endoreversible engines is investigated for the first time. For this, a Novikov-engine with three different heat transport laws (Newtonian, Fourier, asymmetric) is considered. While the maximum work output and corresponding efficiency can be deduced easily in the case of constant heat bath temperatures, this changes, if these temperatures are allowed to fluctuate stochastically. In the latter case, stochastic optimal control theory has to be used to find the maximum of the expected work output and the corresponding control policy. In general, solving such problems leads to a non-linear, partial differential equation coupled to an optimization, called the stochastic Hamilton-Jacobi-Bellman equation. However, as presented in this thesis, calculations can be simplified, if one assumes that the fluctuations are independent of the considered control variable. In this case, analytic considerations show that the equations for performance measures like work output and efficiency keep their original form, but terms have to be replaced by appropriate time averages and expectation values, depending on the considered control type. Based on an analysis of the performance measures in the case of a uniform distribution of the hot temperature of the Novikov engine, conclusions on their monotonicity behavior are drawn. The comparison of several, time independent, symmetric distributions reveals a to date unknown extension to the Curzon-Ahlborn efficiency in the case of small fluctuations. Furthermore, an analysis of a Novikov engine with asymmetric heat transport, where the behavior of the hot temperature is described by an Ornstein-Uhlenbeck process, is performed. Finally, a Novikov engine with Fourier heat transport is considered, where the dynamics of the hot temperature depends on the control variable. By solving the corresponding Hamilton-Jacobi-Bellman equation, new conclusions how to optimally control such systems are drawn.
140

Stratégies optimales d'investissement et de consommation pour des marchés financiers de type"spread" / Optimal investment and consumption strategies for spread financial markets

Albosaily, Sahar 07 December 2018 (has links)
Dans cette thèse, on étudie le problème de la consommation et de l’investissement pour le marché financier de "spread" (différence entre deux actifs) défini par le processus Ornstein-Uhlenbeck (OU). Ce manuscrit se compose de sept chapitres. Le chapitre 1 présente une revue générale de la littérature et un bref résumé des principaux résultats obtenus dans cetravail où différentes fonctions d’utilité sont considérées. Dans le chapitre 2, on étudie la stratégie optimale de consommation / investissement pour les fonctions puissances d’utilité pour un intervalle de temps réduit a 0 < t < T < T0. Dans ce chapitre, nous étudions l’équation de Hamilton–Jacobi–Bellman (HJB) par la méthode de Feynman - Kac (FK). L’approximation numérique de la solution de l’équation de HJB est étudiée et le taux de convergence est établi. Il s’avère que dans ce cas, le taux de convergencedu schéma numérique est super–géométrique, c’est-à-dire plus rapide que tous ceux géométriques. Les principaux théorèmes sont énoncés et des preuves de l’existence et de l’unicité de la solution sont données. Un théorème de vérification spécial pour ce cas des fonctions puissances est montré. Le chapitre 3 étend notre approche au chapitre précédent à la stratégie de consommation/investissement optimale pour tout intervalle de temps pour les fonctions puissances d’utilité où l’exposant γ doit être inférieur à 1/4. Dans le chapitre 4, on résout le problème optimal de consommation/investissement pour les fonctions logarithmiques d’utilité dans le cadre du processus OU multidimensionnel en se basant sur la méthode de programmation dynamique stochastique. En outre, on montre un théorème de vérification spécial pour ce cas. Le théorème d’existence et d’unicité pour la solution classique de l’équation de HJB sous forme explicite est également démontré. En conséquence, les stratégies financières optimales sont construites. Quelques exemples sont donnés pour les cas scalaires et pour les cas multivariés à volatilité diagonale. Le modèle de volatilité stochastique est considéré dans le chapitre 5 comme une extension du chapitre précédent des fonctions logarithmiques d’utilité. Le chapitre 6 propose des résultats et des théorèmes auxiliaires nécessaires au travail.Le chapitre 7 fournit des simulations numériques pour les fonctions puissances et logarithmiques d’utilité. La valeur du point fixe h de l’application de FK pour les fonctions puissances d’utilité est présentée. Nous comparons les stratégies optimales pour différents paramètres à travers des simulations numériques. La valeur du portefeuille pour les fonctions logarithmiques d’utilité est également obtenue. Enfin, nous concluons nos travaux et présentons nos perspectives dans le chapitre 8. / This thesis studies the consumption/investment problem for the spread financial market defined by the Ornstein–Uhlenbeck (OU) process. Recently, the OU process has been used as a proper financial model to reflect underlying prices of assets. The thesis consists of 8 Chapters. Chapter 1 presents a general literature review and a short view of the main results obtained in this work where different utility functions have been considered. The optimal consumption/investment strategy are studied in Chapter 2 for the power utility functions for small time interval, that 0 < t < T < T0. Main theorems have been stated and the existence and uniqueness of the solution has been proven. Numeric approximation for the solution of the HJB equation has been studied and the convergence rate has been established. In this case, the convergence rate for the numerical scheme is super geometrical, i.e., more rapid than any geometrical ones. A special verification theorem for this case has been shown. In this chapter, we have studied the Hamilton–Jacobi–Bellman (HJB) equation through the Feynman–Kac (FK) method. The existence and uniqueness theorem for the classical solution for the HJB equation has been shown. Chapter 3 extended our approach from the previous chapter of the optimal consumption/investment strategies for the power utility functions for any time interval where the power utility coefficient γ should be less than 1/4. Chapter 4 addressed the optimal consumption/investment problem for logarithmic utility functions for multivariate OU process in the base of the stochastic dynamical programming method. As well it has been shown a special verification theorem for this case. It has been demonstrated the existence and uniqueness theorem for the classical solution for the HJB equation in explicit form. As a consequence the optimal financial strategies were constructed. Some examples have been stated for a scalar case and for a multivariate case with diagonal volatility. Stochastic volatility markets has been considered in Chapter 5 as an extension for the previous chapter of optimization problem for the logarithmic utility functions. Chapter 6 proposed some auxiliary results and theorems that are necessary for the work. Numerical simulations has been provided in Chapter 7 for power and logarithmic utility functions. The fixed point value h for power utility has been presented. We study the constructed strategies by numerical simulations for different parameters. The value function for the logarithmic utilities has been shown too. Finally, Chapter 8 reflected the results and possible limitations or solutions

Page generated in 0.0955 seconds