paint-brush
Arbitrage as a Shortest-Path Problemby@skzv
10,569 reads
10,569 reads

Arbitrage as a Shortest-Path Problem

by Sasha Kuznetsov9mJanuary 16th, 2021
Read on Terminal Reader
Read this story w/o Javascript
tldt arrow
EN

Too Long; Didn't Read

In a graph graph, we use computer science and computer science to find the shortest-path to finding arbitrage opportunities. The graph is an incredibly important structure that uses its structure in numerous applications. We need an efficient algorithm, lest someone else beat us to an efficient arbitrageur. The arbitrage opportunity is exploited until the market reaches an equilibrium. We’ve worked with 3 simple examples, but what if you needed to find a market for each pair, how quickly you find an opportunity? And what if it needed to be used in a network of 20 currencies?

Company Mentioned

Mention Thumbnail

Coin Mentioned

Mention Thumbnail
featured image - Arbitrage as a Shortest-Path Problem
Sasha Kuznetsov HackerNoon profile picture
Sasha Kuznetsov

Sasha Kuznetsov

@skzv

Software engineer at Google, engineering physicist by training. Builder by passion. skzv.dev

About @skzv
LEARN MORE ABOUT @SKZV'S
EXPERTISE AND PLACE ON THE INTERNET.
L O A D I N G
. . . comments & more!

About Author

Sasha Kuznetsov HackerNoon profile picture
Sasha Kuznetsov@skzv
Software engineer at Google, engineering physicist by training. Builder by passion. skzv.dev

TOPICS

Languages

THIS ARTICLE WAS FEATURED IN...

Permanent on Arweave
Read on Terminal Reader
Read this story in a terminal
 Terminal
Read this story w/o Javascript
Read this story w/o Javascript
 Lite