mirror of
https://github.com/autistic-symposium/mev-toolkit.git
synced 2025-07-24 15:05:18 -04:00
add atomic vs stat strategies
This commit is contained in:
parent
274675ec20
commit
ebe28def76
14 changed files with 15 additions and 7 deletions
31
MEV_strategies/atomic_arb/algorithms/README.md
Normal file
31
MEV_strategies/atomic_arb/algorithms/README.md
Normal file
|
@ -0,0 +1,31 @@
|
|||
## arbitrage algorithms (tx-ordering based)
|
||||
|
||||
<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)
|
14
MEV_strategies/atomic_arb/algorithms/bellmann_ford/README.md
Normal file
14
MEV_strategies/atomic_arb/algorithms/bellmann_ford/README.md
Normal file
|
@ -0,0 +1,14 @@
|
|||
## bellmann ford algorithm
|
||||
|
||||
<br>
|
||||
|
||||
### tl; dr
|
||||
|
||||
<br>
|
||||
|
||||
<br>
|
||||
|
||||
---
|
||||
|
||||
### resources
|
||||
|
|
@ -0,0 +1,13 @@
|
|||
## ford fulkerson ford algorithm
|
||||
|
||||
<br>
|
||||
|
||||
### tl; dr
|
||||
|
||||
<br>
|
||||
|
||||
<br>
|
||||
|
||||
---
|
||||
|
||||
### resources
|
Loading…
Add table
Add a link
Reference in a new issue