• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • 1
  • 1
  • Tagged with
  • 4
  • 4
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 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.
1

Optimal Order Placement Using Markov Models of Limit Order Books / Optimal Orderläggning med Markovmodeller av Orderböcker

Oliveberg, Max January 2023 (has links)
We study optimal order placement in a limit order book. By modelling the limit order book dynamics as a Markov chain, we can frame the purchase of a single share as a Markov Decision Process. Within the framework of the model, we can estimate optimal decision policies numerically. The trade rate is varied using a running cost control variable. The optimal policy is found to result in a lower cost of trading as a function of the trade rate compared to a market order only strategy. / Vi studerar optimal orderläggning i en limit orderbok. Genom att modellera dynamiken av inkommande ordrar som en Markov kedja så kan vi formula optimal orderläggning som en Markov Decision Process. Inom ramverket av modellen så kan vi skatta optimala strategier numeriskt. En löpande kostnad används som en kontrollvariabel för handelstakten av den optimala strategin. Vi finner att den optimala strategin resulterar i en lägre handelskostnad som funktion av deltagande jämfört med en marknadsorder strategi.
2

Empirical findings in asset price dynamics revealed by quantitative modelling

Sim, Min Kyu 07 January 2016 (has links)
This dissertation addresses the fundamental question of what factors drive equity prices and investigates the mechanisms through which the drivers influence the price dynamics. The studies are based on the two different frequency levels of financial data. The first part aims to identify what systematic risk factors affect the expected return of stocks based on historical data with frequency being daily or monthly. The second part aims to explain how the hidden supply-demand of a stock affects the stock price dynamics based on market data observed at frequency levels generally between a millisecond and a second. With more and more financial market data becoming available, it greatly facilitates quantitative approaches for analyzing asset price dynamics and market microstructure problems. In the first part, we propose an econometric measure, terms as modularity, for characterizing the cluster structure in a universe of stocks. A high level of modularity implies that the cluster structure of the universe of stocks is highly evident, and low modularity implies a blurred cluster structure. The modularity measure is shown to be related to the cycle of the economy. In addition, individual stock's sensitivity to the modularity measure is shown to be related to its expected return. From 1992 to 2011, the average annual return of stocks with the lowest sensitivity exceeds that of the stocks with highest sensitivities by approximately 7.6%. Considerations of modularity as an asset pricing factor expand the investment opportunity set to passive investors. In the second part, we analyze the effect of hidden demands/supplies in equity trading market on the stock price dynamics. We propose a statistical estimation model for average hidden liquidity based on the limit orderbook data. Not only the estimated hidden liquidity explains the probabilistic property in market microstructure better, it also refines the existing price impact model and achieves higher explanation powers. Our enhanced price impact model offers a base for devising optimal order execution strategies. After we develop an optimal execution strategy based on the price impact function, the advantage of this strategy over benchmark strategies is tested on a simulated stock trading model calibrated by historical data. Simulation tests indicate that our strategy yields significant savings in transaction cost over the benchmark strategies.
3

On Numerical Solution Methods for Block-Structured Discrete Systems

Boyanova, Petia January 2012 (has links)
The development, analysis, and implementation of efficient methods to solve algebraic systems of equations are main research directions in the field of numerical simulation and are the focus of this thesis. Due to their lesser demands for computer resources, iterative solution methods are the choice to make, when very large scale simulations have to be performed. To improve their efficiency, iterative methods are combined with proper techniques to accelerate convergence. A general technique to do this is to use a so-called preconditioner. Constructing and analysing various preconditioning methods has been an active field of research already for decades. Special attention is devoted to the class of the so-called optimal order preconditioners, that possess both optimal convergence rate and optimal computational complexity. The preconditioning techniques, proposed and studied in this thesis, utilise the block structure of the underlying matrices, and lead to methods that are of optimal order. In the first part of the thesis, we construct an Algebraic MultiLevel Iteration (AMLI) method for systems arising from discretizations of parabolic problems, using Crouzeix-Raviart finite elements. The developed AMLI method is based on an approximated block factorization of the original system matrix, where the partitioning is associated with a sequence of nested discretization meshes. In the second part of the thesis we develop solution methods for the numerical simulation of multiphase flow problems, modelled by the Cahn-Hilliard (C-H) equation. We consider the discrete C-H problem, obtained via finite element discretization in space and implicit schemes in time. We propose techniques to precondition the Jacobian of the discrete nonlinear system, based on its natural two-by-two block structure. The preconditioners are used in the framework of inexact Newton methods. We develop two nonlinear solution algorithms for the Cahn-Hilliard problem. Both lead to efficient optimal order methods. One of the main advantages of the proposed methods is that they are implemented using available software toolboxes for both sequential and distributed execution. The theoretical analysis of the solution methods presented in this thesis is combined with numerical studies that confirm their efficiency.
4

Αναλυτικά μαθηματικά μοντέλα για προβλήματα παραγωγής και αποθήκευσης προϊόντων

Ζώη, Κωνσταντίνα 19 August 2010 (has links)
Ο προγραμματισμός παραγωγής και ελέγχου αποθεμάτων αποσκοπεί στην εύρεση της “χρυσής τομής” μεταξύ δυο αντιφατικών στόχων, από πλευράς ελαχιστοποίησης του συνολικού κόστους λειτουργίας μιας επιχείρησης: της μείωσης απ’ τη μια του διαθέσιμου αποθέματος και της ύπαρξης απ’ την άλλη ικανής ποσότητας διαθέσιμων αγαθών έτσι ώστε να καλύπτεται η ζήτησή τους στην αγορά. Ο συμβιβασμός μεταξύ αυτών των δυο στόχων επιτυγχάνεται με την δημιουργία κατάλληλων μαθηματικών κανόνων για τη χρονική (πότε;) και ποσοτική (πόσο;) διακίνηση του αποθέματος. Για την επίλυσή του έχουν προταθεί διάφορα μαθηματικά μοντέλα, τα οποία ποσοτικοποιούν τις παραμέτρους κόστους και εκφράζουν το συνολικό κόστος λειτουργίας της επιχείρησης με τη χρήση μιας συνάρτησης η οποία βελτιστοποιείται με εφαρμογή μαθηματικών μεθόδων. Η παρούσα εργασία επικεντρώνεται στην παρουσίαση των πιο ευρέως χρησιμοποιούμενων, προσδιοριστικών μοντέλων (όλες οι παράμετροι του συστήματος είναι γνωστές σταθερές) ενώ ο ορίζοντας σχεδιασμού θεωρείται πεπερασμένος. Στο πρώτο κεφάλαιο της παρούσας εργασίας παρουσιάζονται τα γενικά χαρακτηριστικά ενός προβλήματος παραγωγής και αποθήκευσης καθώς επίσης τα σχετικά με αυτό κόστη. Στο δεύτερο κεφάλαιο ακολουθεί η παρουσίαση των μοντέλων της Οικονομικής Ποσότητας Παραγγελίας, στα οποία θεωρείται ότι η ζήτηση πραγματοποιείται με ένα σταθερό ρυθμό και ότι το απόθεμα επιθεωρείται διαρκώς (ο χρόνος θεωρείται συνεχής). Αντίθετα, στα μοντέλα του τρίτου κεφαλαίου ο ορίζοντας σχεδιασμού χωρίζεται σε τακτά χρονικά διαστήματα, δηλαδή γίνεται η παραδοχή ότι ο χρόνος είναι διακριτός. Τέλος, στο τέταρτο αντιστοιχείται σε κάθε μοντέλο που αναλύθηκε στα προηγούμενα κεφαλαία, μια ολοκληρωμένη εφαρμογή η οποία επιλύεται λεπτομερώς. / Programmising the production and stock control aims to find the “golden mean” between two contradictory goals : as far as minimizing the total service expenses of a company is concerned, reduce the available cost, and on the other hand the existence of another one adequate quantity of available goods, so that their demand in the market can be covered. The compromising between these two goals can be achieved with the creation of appropriate mathematic rules about the time (when?) and amount (how much?) stock circulation. In order to achieve this compromising, many mathematical models have been proposed which quantify the subsiding costs and express the total service expenses of the company, using a function which is constantly being improved with the application of mathematical methods. The present project focuses on the presentation of the most widely used defining models, while the designing horizon is considered to be passed by. In the first part of the present project appear the general characteristics of a problem concerning the production and saving, as well as the relevant costs. The second part includes the presentation of the model about the Economic Order Quantity, in which it is regarded that demand is accomplished with a steady pace, and that the stock is constantly being checked (time is regarded to be continuous). On the other hand, in the model of the third part, the designing horizon is divided in regular time spaces, reaching the conclusion that time is apparent significant. Finally in the last part, each model analyzed in the previous chapters, is matched with a complete application, being solved in detail.

Page generated in 0.0503 seconds