Return to search

Minimizing initial margin requirements using computational optimization

Trading contracts with future commitments requires posting a collateral, called initial margin requirement, to cover associated risks. Differences in estimating those risks and varying risk appetites can however lead to identical contracts having different initial margin requirements at different market places. This creates a potential for minimizing those requirements by reallocating contracts. The task of minimizing the requirement is identified as a black-box optimization problem with constraints. The aim of this project was to investigate that optimization problem, how it can best be tackled, and comparing different techniques for doing so. Based on the results and obstacles encountered along the way, some guidelines are then outlined to provide assistance for whomever is interested in solving this or similar problems. The project consisted both of a literature study to examine existing knowledge within the subject of optimization, and an implementation phase to empirically test how well that knowledge can be put to use in this case. During the latter various algorithms were tested in a number of different scenarios. Focus was put on practical aspects that could be important in a real situation, such as how much they could decrease the initial margin requirement, execution time, and ease of implementation. As part of the literature study, three algorithms were found which were evaluated further: simulated annealing, differential evolution, and particle swarm optimization. They all work without prior knowledge of the function to be optimized, and are thus suitable for black-box optimization. Results from the implementation part showed largely similar performance between all three algorithms, indicating that other aspects such as ease of implementation or parallelization potential can be more important to consider when choosing which one to use. They were all well able to optimize different portfolios in a number of different cases. However, in more complex situations they required much more time to do so, showing a potential need to speed up the process.

Identiferoai:union.ndltd.org:UPSALLA1/oai:DiVA.org:umu-212173
Date January 2023
CreatorsAhlman Bohm, Jacob
PublisherUmeå universitet, Institutionen för datavetenskap
Source SetsDiVA Archive at Upsalla University
LanguageEnglish
Detected LanguageEnglish
TypeStudent thesis, info:eu-repo/semantics/bachelorThesis, text
Formatapplication/pdf
Rightsinfo:eu-repo/semantics/openAccess
RelationUMNAD ; 1431

Page generated in 0.0021 seconds