Paper: arXiv 2508.03217
Authors: Yu Zhang, Claudio J. Tessone
Abstract
The efficiency of decentralized exchanges (DEXs) and the influence of token routing algorithms on market performance and stakeholder outcomes remain underexplored. This paper introduces the concept of Standardized Total Arbitrage Profit (STAP), computed via convex optimization, as a systematic measure of DEX efficiency. We prove that executing the trade order maximizing STAP and reintegrating the resulting transaction fees eliminates all arbitrage opportunities-both cyclic arbitrage within DEXs and between DEXs and centralized exchanges (CEXs). In a fully efficient DEX (i.e., STAP = 0), the monetary value of target tokens received must not exceed that of the source tokens, regardless of the routing algorithm. Any violation indicates arbitrage potential, making STAP a reliable metric for arbitrage detection. Using a token graph comprising 11 tokens and 18 liquidity pools based on Uniswap V2 data, we observe a decline in DEX efficiency between June 21 and November 8, 2024. Simulations comparing two routing algorithms-Yu Zhang et al.’s line-graph-based method and the depth-first search (DFS) algorithm-show that employing more profitable routing improves DEX efficiency and trader returns over time. Moreover, while total value locked (TVL) remains stable with the line-graph method, it increases under the DFS algorithm, indicating greater aggregate benefits for liquidity providers.
Complexity vs Empirical Score
- Math Complexity: 8.5/10
- Empirical Rigor: 7.5/10
- Quadrant: Holy Grail — high math complexity, high empirical rigor
Why this score: The paper introduces advanced convex optimization concepts (Standardized Total Arbitrage Profit) with mathematical proofs, demonstrating high math density. It also employs empirical methods with a specific token graph, Uniswap V2 data spanning six months, and simulations comparing routing algorithms, resulting in high implementation and backtest readiness.
Research Flowchart
flowchart TD
A["Research Goal:<br>Measure DEX Efficiency &<br>Assess Routing Algorithms"] --> B["Methodology:<br>Compute STAP<br>(Standardized Total Arbitrage Profit)<br>via Convex Optimization"]
B --> C["Data/Inputs:<br>11 Tokens, 18 Liquidity Pools<br>(Uniswap V2)"]
C --> D["Computational Process:<br>Simulate Trades &<br>Compare Routing Algorithms<br>(Line-Graph vs. DFS)"]
D --> E{"Analysis of<br>Outcomes"}
E --> F["Key Finding 1:<br>STAP = 0 implies DEX Efficiency<br>STAP > 0 implies Arbitrage"]
E --> G["Key Finding 2:<br>More Profitable Routing<br>(DFS) improves Efficiency,<br>Trader Returns, & TVL"]
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes the Standardized Total Arbitrage Profit (STAP) as a systematic measure of DEX efficiency and evaluates the impact of two token routing algorithms (a line‑graph‑based method and a depth‑first search algorithm) on DEX efficiency and stakeholder benefits.
Source sentence
This paper introduces the concept of Standardized Total Arbitrage Profit (STAP), computed via convex optimization, as a systematic measure of DEX efficiency. Simulations comparing two routing algorithms-Yu Zhang et al.'s line-graph-based method and the depth-first search (DFS) algorithm-show that employing more profitable routing improves DEX efficiency and trader returns over time.
Assumes 6
- We assume that \(\Delta a_1^{out} = \Delta b_1^{in} = 0\), i.e., the trade sells token A to buy token B. model
Source sentence
We assume that ∆a1 out = ∆b1 in = 0, then ∆a1 in ≥0 and ∆b1 out ≥0, which means we sell token A to buy token B. Then, the above equation 4 will be simplified as the following equation 5: ∂F ∂∆a1 in = −PA + L1γ(b1 −∆b1 out) = 0 ∂F ∂∆b1 out = PB −L1(a1 + γ∆a1 in) = 0 · · · (5) Then we have PA PB = γ(b1−∆b1∗ out) a1+γ∆a1∗ in .
- We assume token prices from centralized exchanges (CEX) remain unchanged during the simulated token trading sequences. market
Source sentence
When we research token routing algorithms’ effect on the DEX efficiency and stakeholders’ benefits, we simulate a sequence of random token trading and keep the tokens’ CEX prices unchanged.
- Only liquidity pools with total value locked (TVL) larger than ten thousand dollars are selected for the token graph. data
Source sentence
During the construction of the token graph with Uniswap V2 pool reserve data, we first select pools whose total value locked (TVL) is larger than ten thousand dollars.
- The token graph is limited to 11 tokens and 18 liquidity pools because of the computational limitation of the cvxpy package. data
Source sentence
After token filtering, there are 11 tokens and 18 liquidity pools in total in the token graph, which is shown in Fig.3 1. cvxpy is a Python package for solving convex optimization problems WETH WBTC SYLO USDC USDT DAI DAO BLZ RACA MKR AGIX Figure 3: Token graph.
Show 2 more
- The convex optimization problem used to compute maximal arbitrage profit is solved to optimality, implying the model accurately captures the AMM pricing and fee structure. model
Source sentence
ponds to the liquidity pool containing a1 units of token A and b1 units of token B. Then we calculate the derivative of F to all variables, including ∆ai out, ∆bi in, etc.. ∂F ∂∆a1 in = −PA + L1γ(b1 + γ∆b1 in −∆b1 out) = 0 ∂F ∂∆b1 out = PB −L1(a1 + γ∆a1 in −∆a1 out) = 0 · · · (4) Because this is a convex optimization problem, the optimal solution must be on the boundary of the constraints. Namely (a1 + γ∆a1 in −∆a1
- Liquidity providers receive the retained transaction fee (\(\lambda\Delta a\) or \(\lambda\Delta b\)) as a reward after each trade. execution
Source sentence
After calculating the number of target tokens based on the CPMM rule as shown above in equation 1 (that are ∆b in the first equation and ∆a in the second equation), the retained transaction fee (that are λ∆a in the first equation and λ∆b in the second equation) will go to the liquidity pool again as a reward to liquidity providers. In the first phase, the transaction fee is retained, the number of tokens to be
Data
- Uniswap V2 pool reserve data crypto-onchain public
Source sentence
Data Description The pool reserves’ data is from Uniswap V2 on the Ethereum blockchain, ranging from June 21, 2024, to Figure 2: The trading interface of Sushiswap. After token filtering, there are 11 tokens and 18 liquidity pools in total in the token graph, which is shown in Fig.3 1. cvxpy is a Python package for solving convex optimization problems WETH WBTC SYLO USDC USDT DAI DAO BLZ RACA MKR AGIX Figure 3:
- CoinGecko token price time series market-prices public
Source sentence
Cryptocurrencies’ daily price time se-ries data is from CoinGecko.
Costs
Modeled
A retained transaction fee (λ·Δa or λ·Δb) is taken from each trade and added back to the liquidity pool as a reward to liquidity providers.
Source sentence
After calculating the number of target tokens based on the CPMM rule as shown above in equation 1 (that are ∆b in the first equation and ∆a in the second equation), the retained transaction fee (that are λ∆a in the first equation and λ∆b in the second equation) will go to the liquidity pool again as a reward to liquidity providers. In the first phase, the transaction fee is retained, the number of tokens to be
Finds 5
- DEX efficiency, measured by STAP, declines from June 21, 2024 to November 8, 2024. theoretical
Source sentence
Using a token graph comprising 11 tokens and 18 liquidity pools based on Uniswap V2 data, we observe a decline in DEX efficiency between June 21 and November 8, 2024.
- Using the line‑graph‑based routing algorithm improves DEX efficiency more than the depth‑first search (DFS) algorithm. performance
Source sentence
Simulations comparing two routing algorithms-Yu Zhang et al.'s line-graph-based method and the depth-first search (DFS) algorithm-show that employing more profitable routing improves DEX efficiency and trader returns over time. We find that the line-graph-based method can help to improve the efficiency of the DEX more than the DFS algorithm.
- Total value locked (TVL) remains almost constant when the line‑graph method is used, but increases almost linearly under the DFS algorithm. performance
Source sentence
Moreover, while total value locked (TVL) remains stable with the line-graph method, it increases under the DFS algorithm, indicating greater aggregate benefits for liquidity providers. The TVL increases almost linearly with more token trading if the DFS algorithm is used for token routing, which means that the liquidity pool providers will benefit as a whole sector from a poor routing algorithm.
- When the line‑graph routing is applied, the cumulative monetized value of target tokens received by traders is almost equal to the value of source tokens invested; under DFS, the cumulative received value is much lower. performance
Source sentence
If we take all traders as a whole sector, we find that the accumulative monetized value of the target tokens that traders receive is almost equal to the monetized value of the source tokens that traders input if the line-graph-based routing method is applied. However, this accumulative monetized value of traders received by using the DFS algorithm is much lower comparatively.
- Executing the trade order that maximizes STAP eliminates all cyclic arbitrage opportunities within DEXs and arbitrage between DEXs and CEXs. theoretical
Source sentence
We prove that executing the trade order maximizing STAP and reintegrating the resulting transaction fees eliminates all arbitrage opportunities-both cyclic arbitrage within DEXs and between DEXs and centralized exchanges (CEXs).
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 25 related papers). Coverage is partial, so this is neither replication nor refutation.
Code
No repository by the authors found in the paper.
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.
Cited References (9)
- Bitcoin: A peer-to-peer electronic cash system (2008)
- An Improved Algorithm to Identify More Arbitrage Opportunities on Decentralized Exchanges — → 2406.16573
- A Line Graph-Based Framework for Identifying Optimal Routing Paths in Decentralized Exchanges — → 2504.15809
- Transaction flows and holding time scaling laws of bitcoin (2025)
- SoK: Decentralized Finance (DeFi)–Fundamentals, Taxonomy and Risks (2024) — link
- Cyclic arbitrage in decentralized exchanges (2022)
- A large scale study of the ethereum arbitrage ecosystem (2023)
- Global order routing on exchange networks (2021)
and 1 more
- An empirical study of market inefficiencies in Uniswap and SushiSwap (2022) — link
2 of 9 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.