Portfolio selection has always been a fundamental challenge in the field of finance and captured the attention of researchers in the financial area. Merton's portfolio problem is an optimization problem in finance and aims to maximize an investor's portfolio. This thesis studies Merton's Optimal Investment-Consumption Problem under the Jourdain--Sbai stochastic volatility model and seeks to maximize the expected discounted utility of consumption and terminal wealth. The results of our study can be split into three main parts. First, we derived the Hamilton--Jacobi--Bellman equation related to our stochastic optimal control problem.  Second, we simulated the optimal controls, which are the weight of the risky asset and consumption. This has been done for all the three models within the scope of the Jourdain--Sbai model: Quadratic Gaussian, Stein & Stein, and Scott's model. Finally, we developed the system of equations after applying the Crank-Nicolson numerical scheme when solving our HJB partial differential equation.

We aim at generalizing the celebrated portfolio optimization problem "à la Merton", where the asset evolution is steered by a self-exciting jump-diffusion process. We first define the rigorous mathematical framework needed to introduce the stochastic optimal control problem we are interesting in. Then, we provide a proof for a specific version of the Dynamic Programming Principle (DPP) with respect to the general class of self-exciting processes under study. After, we state the Hamilton-Jacobi-Bellman (HJB) equation, whose solution gives the value function for the corresponding optimal control problem. The resulting HJB equation takes the form of a Partial-Integro Differential Equation (PIDE), for which we prove both existence and uniqueness for the solution in the viscosity sense. We further derive a suitable numerical scheme to solve the HJB equation corresponding to the portfolio optimizationproblem. To this end, we also provide a detailed study of solution dependence on the parameters of the problem. The analysis is performed by calibrating the model on ENI asset levels during the COVID-19 worldwide breakout. In particular, the calibration routine is based on a sophisticated Sequential Monte Carlo algorithm.

Dans ce mémoire, nous avons proposé une méthode basée sur l'utilisation de la généralisation du lemme de Gronwall-Bellman pour garantir des conditions suffisantes de stabilisation asymptotique pour une classe de systèmes non linéaires fractionnaires. Nous avons étendu ces résultats dans la stabilisation asymptotique des systèmes non linéaires singuliers fractionnaires et proposé des conditions suffisantes de stabilité asymptotique de l'erreur d'observation dans le cas de l'étude des observateurs pour les systèmes non linéaires fractionnaires et singuliers fractionnaires.Pour les systèmes non linéaires à dérivée d'ordre entier, nous avons proposé par l'application de la généralisation du lemme de Gronwall-Bellman des conditions suffisantes pour :- la stabilisation exponentielle par retour d'état statique et par retour de sortie statique,- la stabilisation exponentielle robuste en présence d'incertitudes paramétriques,- la commande basée sur un observateur.Nous avons étudié la stabilisation des systèmes linéaires fractionnaires avec les lois de commande suivantes~: retour d'état statique, retour de sortie statique et retour de sortie basé sur un observateur. Puis, nous avons proposé des conditions suffisantes de stabilisation lorsque le système linéaire fractionnaire est affecté par des incertitudes non linéaires paramétriques. Enfin, nous avons traité la synthèse d'un observateur pour ces systèmes. Les résultats proposés pour les systèmes linéaires fractionnaires ont été étendus au cas où ces systèmes fractionnaires sont singuliers.La technique de stabilisation basée sur l'utilisation de la généralisation du lemme de Gronwall-Bellman est étendue aux systèmes non linéaires fractionnaires et aux systèmes non linéaires singuliers fractionnaires. Des conditions suffisantes de stabilisation asymptotique, de stabilisation asymptotique robuste et de commande basée sur un observateur ont été obtenues pour les classes de systèmes non linéaires fractionnaires et non linéaires singuliers fractionnaires.Par ailleurs, une méthode de synthèse d'observateurs pour ces systèmes non linéaires fractionnaires et non linéaires singuliers fractionnaires est proposée. Cette approche est basée sur la résolution d'un système d'équations de Sylvester. L'avantage de cette méthode est que, d'une part, l'erreur d'observation ne dépend pas explicitement de l'état et de la commande du système et, d'autre part, qu'elle unifie la synthèse d'observateurs de différents ordres (observateurs d'ordre réduit, d'ordre plein et d'ordre minimal). / In this dissertation, we proposed sufficient conditions for the asymptotical stabilization of a class of nonlinear fractional-order systems based on the generalization of Gronwall-Bellman lemma. We extended these results for the asymptotical stabilization of nonlinear singular fractional-order systems and proposed sufficient conditions for the existence and asymptotic stability of the observation error for the nonlinear fractional-order systems and nonlinear singular fractional-order systems.For the nonlinear integer-order systems, the proposed generalization of Gronwall-Bellman lemma allowed us to obtain sufficient conditions for :- the static state feedback and the static output feedback exponential stabilizations,- the robust exponential stabilization with regards to parameter uncertainties,- the observer-based control.We treated three cases for the asymptotical stabilization of linear fractional-order systems : the static state feedback, the static output feedback and the observer-based output feedback. Then, we proposed sufficient conditions for the asymptotical stabilization of linear fractional-order systems with nonlinear uncertain parameters. Finally, we treated the observer design for the linear and nonlinear fractional-order systems and for the linear and nonlinear singular fractional-order systems.The stabilization technique based on the generalization of Gronwall-Bellman lemma is extended to nonlinear fractional-order systems and nonlinear singular fractional-order systems. Sufficient conditions for the asymptotical stabilization, the robust asymptotical stabilization and the observer-based control of a class of nonlinear fractional-order systems and nonlinear singular fractional-order systems were obtained.Furthermore, the observer design for the nonlinear fractional-order systems and nonlinear singular fractional-order systems is proposed. This approach is based on a parameterization of the solutions of generalized Sylvester equations. The conditions for the existence of these observers are given and sufficient conditions for their stability are derived using linear matrix inequalities (LMIs) formulation and the generalization of Gronwall-Bellman lemma. The advantage of this method is that, firstly, the observation error does not depend explicitly on the state and control system and, secondly, this method unifies the design of full, reduced and minimal orders observers

Economic uncertainty may affect significantly people’s behavior and hence macroeconomic variables. It is thus important to understand how people behave in presence of different kinds of economic risk. The present dissertation focuses therefore on the impact of the uncertainty in capital and labor income on the individual saving behavior. The underlying uncertain variables are here modeled as stochastic processes that each obey a specific stochastic differential equation, where uncertainty stems either from Poisson or Lévy processes. The results on the optimal behavior are derived by maximizing the individual expected lifetime utility. The first chapter is concerned with the necessary mathematical tools, the change-of-variables formula and the Hamilton-Jacobi-Bellman equation under Poisson uncertainty. We extend their possible field of application in order make them appropriate for the analysis of the dynamic stochastic optimization problems occurring in the following chapters and elsewhere. The second chapter considers an optimum-saving problem with labor income, where capital risk stems from asset prices that follow geometric L´evy processes. Chapter 3, finally, studies the optimal saving behavior if agents face not only risk but also uncertain spells of unemployment. To this end, we turn back to Poisson processes, which here are used to model properly the separation and matching process.

Problems involving optimal sequential making in uncertain dynamic systems arise in domains such as engineering, science and economics. Such problems can often be cast in the framework of Markov Decision Process (MDP). Solving an MDP requires computing the optimal value function and the optimal policy. The idea of dynamic programming (DP) and the Bellman equation (BE) are at the heart of solution methods. The three important exact DP methods are value iteration, policy iteration and linear programming. The exact DP methods compute the optimal value function and the optimal policy. However, the exact DP methods are inadequate in practice because the state space is often large and in practice, one might have to resort to approximate methods that compute sub-optimal policies. Further, in certain cases, the system observations are known only in the form of noisy samples and we need to design algorithms that learn from these samples. In this thesis we study interesting theoretical questions pertaining to approximate and learning algorithms, and also present an interesting application of MDPs in the domain of crowd sourcing. Approximate Dynamic Programming (ADP) methods handle the issue of large state space by computing an approximate value function and/or a sub-optimal policy. In this thesis, we are concerned with conditions that result in provably good policies. Motivated by the limitations of the PBE in the conventional linear algebra, we study the PBE in the (min, +) linear algebra. It is a well known fact that deterministic optimal control problems with cost/reward criterion are (min, +)/(max, +) linear and ADP methods have been developed for such systems in literature. However, it is straightforward to show that infinite horizon discounted reward/cost MDPs are neither (min, +) nor (max, +) linear. We develop novel ADP schemes namely the Approximate Q Iteration (AQI) and Variational Approximate Q Iteration (VAQI), where the approximate solution is a (min, +) linear combination of a set of basis functions whose span constitutes a subsemimodule. We show that the new ADP methods are convergent and we present a bound on the performance of the sub-optimal policy. The Approximate Linear Program (ALP) makes use of linear function approximation (LFA) and offers theoretical performance guarantees. Nevertheless, the ALP is difficult to solve due to the presence of a large number of constraints and in practice, a reduced linear program (RLP) is solved instead. The RLP has a tractable number of constraints sampled from the original constraints of the ALP. Though the RLP is known to perform well in experiments, theoretical guarantees are available only for a specific RLP obtained under idealized assumptions. In this thesis, we generalize the RLP to define a generalized reduced linear program (GRLP) which has a tractable number of constraints that are obtained as positive linear combinations of the original constraints of the ALP. The main contribution here is the novel theoretical framework developed to obtain error bounds for any given GRLP. Reinforcement Learning (RL) algorithms can be viewed as sample trajectory based solution methods for solving MDPs. Typically, RL algorithms that make use of stochastic approximation (SA) are iterative schemes taking small steps towards the desired value at each iteration. Actor-Critic algorithms form an important sub-class of RL algorithms, wherein, the critic is responsible for policy evaluation and the actor is responsible for policy improvement. The actor and critic iterations have deferent step-size schedules, in particular, the step-sizes used by the actor updates have to be generally much smaller than those used by the critic updates. Such SA schemes that use deferent step-size schedules for deferent sets of iterates are known as multitimescale stochastic approximation schemes. One of the most important conditions required to ensure the convergence of the iterates of a multi-timescale SA scheme is that the iterates need to be stable, i.e., they should be uniformly bounded almost surely. However, the conditions that imply the stability of the iterates in a multi-timescale SA scheme have not been well established. In this thesis, we provide veritable conditions that imply stability of two timescale stochastic approximation schemes. As an example, we also demonstrate that the stability of a widely used actor-critic RL algorithm follows from our analysis. Crowd sourcing (crowd) is a new mode of organizing work in multiple groups of smaller chunks of tasks and outsourcing them to a distributed and large group of people in the form of an open call. Recently, crowd sourcing has become a major pool for human intelligence tasks (HITs) such as image labeling, form digitization, natural language processing, machine translation evaluation and user surveys. Large organizations/requesters are increasingly interested in crowd sourcing the HITs generated out of their internal requirements. Task starvation leads to huge variation in the completion times of the tasks posted on to the crowd. This is an issue for frequent requesters desiring predictability in the completion times of tasks specified in terms of percentage of tasks completed within a stipulated amount of time. An important task attribute that affects the completion time of a task is its price. However, a pricing policy that does not take the dynamics of the crowd into account might fail to achieve the desired predictability in completion times. Here, we make use of the MDP framework to compute a pricing policy that achieves predictable completion times in simulations as well as real world experiments.

Les problèmes abordés et les résultats obtenus dans cette thèse se divisent en deux parties. La première concerne l'étude de la valeur asymptotique de jeux dépendant de la fréquence (jeux-FD). Nous introduisons un jeu différentiel associé au jeu-FD dont la valeur se ramène à une équation de Hamilton-Jacobi-Bellman-lsaacs. En affrontant un problème d'irrégularité à l'origine, nous prouvons l’existence de la valeur du jeu différentiel sur [0.1 ] et ceci nous permet de prouver que la valeur du jeu FD converge vers la valeur du jeu continu qui débute à l'état initial 0. Dans la deuxième partie, l'objectif fondamental est la décomposition de l'espace des jeux finis en sous espaces des jeux adéquats et plus faciles à étudier vu que leurs équilibres sont distingués. Cette partie est divisée en deux chapitres. Dans le premier chapitre, nous établissons une décomposition canonique de tout jeu arbitraire fini en trois composantes et nous caractérisons les équilibres approximatifs d'un jeu donné par les équilibres uniformément mixtes et en stratégies dominantes lesquels apparaissent sur ses composantes. Dans le deuxième chapitre, nous introduisons sur l'espace des jeux finis une famille de produits scalaires et nous définissons la classe des jeux harmoniques relativement au produit scalaire choisi dans cette famille. Inspiré par la décomposition de Helmholtz-Hodge appliquée aux jeux par Candogan et al. (2011), nous établissons une décomposition orthogonale de l'espace des jeux finis, par rapport au produit scalaire choisi, en les sous espaces des jeux potentiels, des jeux harmoniques et des jeux non­stratégiques c nous généralisons les résultats de Candogan et al. (2011). / The problems addressed and results obtained in this thesis are divided in two parts. The first part concerns the study of the asymptotic value of frequency-dependent games (FD-games). We introduce a differential game associated to the FD-game whose value leads to a Hamilton-Jacob-Bellman-lsaacs equation. Although an irregularity occurs at the origin, we prove existence of the value in the differential game played over [0.1 ], which allows to prove that the value of the FD-game, as the number of stages tend to infinity, converges to the value of the continuous-time game with initial state 0. ln the second part, the objective is the decomposition of the space of finite games in subspaces of suitable games which admit disguised equilibria and more tractable analysis. This part is divided in two chapters. In the first chapter, we establish a canonical decomposition of an arbitrary game into three components and we characterize the approximate equilibria of a given game in terms of the uniform equilibrium and the equilibrium in dominant strategies that appear in its components. In the second part, we introduce a family of inner products in the space of finite games and we define the class of harmonic games relatively to the chosen inner product. Inspired of the Helmholtz-Hodge decomposition applied to games by Candogan et al (2011 ), we establish an orthogonal decomposition of the space of finite games with respect to the chosen inner product, in the subspaces of potential harmonic and non-strategic games and we further generalize several results of Candogan et al (2011).

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.

Cette thèse est composée de trois parties. Dans la première nous montrons l'existence et l'unicité de la solution continue et à croissance polynomiale, au sensviscosité, du système non linéaire de m équations variationnelles de type intégro-différentiel à obstacles unilatéraux interconnectés. Ce système est lié au problème du switching optimal stochastique lorsque le bruit est dirigé par un processus de Lévy. Un cas particulier du système correspond en effet à l’équation d’Hamilton-Jacobi-Bellman associé au problème du switching et la solution de ce système n’est rien d’autre que la fonction valeur du problème. Ensuite, nous étudions un système d’équations intégro-différentielles à obstacles bilatéraux interconnectés. Nous montrons l’existence et l’unicité des solutions continus à croissance polynomiale, au sens viscosité, des systèmes min-max et max-min. La démarche conjugue les systèmes d’EDSR réfléchies ainsi que la méthode de Perron. Dans la dernière partie nous montrons l’égalité des solutions des systèmes max-min et min-max d’EDP lorsque le bruit est uniquement de type diffusion. Nous montrons que si les coûts de switching sont assez réguliers alors ces solutions coïncident. De plus elles sont caractérisées comme fonction valeur du jeu de switching de somme nulle. / There are three main results in this thesis. The first is existence and uniqueness of the solution in viscosity sense for a system of nonlinear m variational integral-partial differential equations with interconnected obstacles. From the probabilistic point of view, this system is related to optimal stochastic switching problem when the noise is driven by a Lévy process. As a by-product we obtain that the value function of the switching problem is continuous and unique solution of its associated Hamilton-Jacobi-Bellman system of equations. Next, we study a general class of min-max and max-min nonlinear second-order integral-partial variational inequalities with interconnected bilateralobstacles, related to a multiple modes zero-sum switching game with jumps. Using Perron’s method and by the help of systems of penalized unilateral reflected backward SDEs with jumps, we construct a continuous with polynomial growth viscosity solution, and a comparison result yields the uniqueness of the solution. At last, we deal with the solutions of systems of PDEs with bilateral inter-connected obstacles of min-max and max-min types in the Brownian framework. These systems arise naturally in stochastic switching zero-sum game problems. We show that when the switching costs of one side are smooth, the solutions of the min-max and max-min systems coincide. Furthermore, this solution is identified as the value function of the zero-sum switching game.

This work is intended on identification with basic problems from the graphs theory area. There are the basic conceptions as well more complicated problems described. The one part of this work is specialized in working of individual types of graphs. It starts with single linked list through double linked list after as much as trees which represented the simplest graphs textures. The other part of this work devotes to the whole graph and describes more complicated problems and their resolution from the theory graphs area. Among these problems belongs to searching in graphs help by Depth First Search and Breadth First Search methods. Then searching the shortest way help by the specific algorithms as are: Dijkstra´s algorithm, Floyd-Warshall´s algorithm and Bellman-Ford´s algorithm. The last part is devoted to problems with searching minimal frames of graphs with usage Kruskal´s algorithm, Jarnik´s algorithm and Boruvka´s algorithm methods.

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