ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Identifying optimal paths for purchasing cryptocurrencies.

Andraž Povše (2018) Identifying optimal paths for purchasing cryptocurrencies.. EngD thesis.

[img]
Preview
PDF
Download (1926Kb)

    Abstract

    Increase of trend in trading cryptocurrencies, ease of use, surge in media attention and the idea of making quick money were contributing factors for massive growth in users in the year 2017. To start trading, the user must rst register on the desired exchange to which he transfers his funds and exchanges them for the chosen cryptocurrency. In the event that the target cryptocurrency is not available on this exchange, he must create another account on a di�erent exchange, send the currency there and execute another trade. Many times users do not realise all the fees that take place during this process. The goal of this Bachelor's thesis is to create an algorithm that provides the end user with optimal path for purchasing a speci�c cryptocur- rency. Based on data, provided by API points, the algorithm generates a network of trading pairs in which it �nds the optimal path for purchase. The user can then make actions based on the provided path. The algorithm is made in programming language Python, using MongoDB database and set up as a web application using Flask and Vue frameworks.

    Item Type: Thesis (EngD thesis)
    Keywords: cryptocurrency, cryptocurrency exchange, shortest path, pur- chasing cryptocurrencies
    Number of Pages: 64
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    doc. dr. Dejan Lavbič302Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1537908675)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 4191
    Date Deposited: 11 Sep 2018 16:32
    Last Modified: 20 Sep 2018 10:59
    URI: http://eprints.fri.uni-lj.si/id/eprint/4191

    Actions (login required)

    View Item