mev-toolkit/MEV_strategies/arbitrage/algorithms/README.md
dr. mia von steinkirch, phd 04c9eea7d8
Update README.md
2023-02-10 09:32:26 -08:00

31 lines
692 B
Markdown

## arbitrage algorithms
<br>
### tl; dr
<br>
* these algorithms are represented by multi-edged graph data structures where nodes represent coins and edges represents rates.
* to find an arb opportunity, find a closed loop of edges for which the product of weights in the edges > 1.
<br>
### in this
<br>
* [belmman-ford](bellmann_ford)
* [ford-fulkerson](ford_fulkerson)
<br>
---
### resources
<br>
* [all is fair in arb, by ddmckinnon](https://www.ddmckinnon.com/2022/11/27/all-is-fair-in-arb-and-mev-on-avalanche-c-chain/)
* [on classifying complex networks, by dr. m. von steinkirch](https://github.com/go-outside-labs/ml-graph-network-analyser/blob/master/final_report.pdf)