Analysis of Trading Functions in Automated Market Making

Bachelor Thesis (2023)
Author(s)

A.R. Husain Cornelissen (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Contributor(s)

N. Parolya – Mentor (TU Delft - Statistics)

Robbert Fokkink – Graduation committee member (TU Delft - Applied Probability)

Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright
© 2023 Adnan Husain Cornelissen
More Info
expand_more
Publication Year
2023
Language
English
Copyright
© 2023 Adnan Husain Cornelissen
Graduation Date
07-07-2023
Awarding Institution
Delft University of Technology
Programme
['Applied Mathematics']
Faculty
Electrical Engineering, Mathematics and Computer Science
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Automated Market Makers (AMMs) are a novel type of market makers that eliminate the need for a coun-terparty in a trade. This thesis analyses the properties of several types of AMMs, and in particular the con-centrated liquidity market maker. An axiomatic definition of AMMs is provided, and two types of constant function market makers (CFMMs), called the constant sum market maker (CSMM) and constant product market maker (CPMM), are explored. The concentrated liquidity market maker, which improves liquidity provision compared to the CPMM, is thoroughly analyzed, and it is shown that it’s trading function can be formulated as a composition of functions. This thesis also conjectures that the concentrated liquidity trading function can be approximated by taking an infinite number of compositions. Additionally, a simulation study is conducted using transaction mocking. The simulation study supports the conjecture, and brings several other noteworthy properties of the concentrated liquidity market maker to light.

Files

License info not available