Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2603.27172 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917365637185536 |
|---|---|
| author | Jiang, Ruichao Wen, Long |
| author_facet | Jiang, Ruichao Wen, Long |
| contents | The transfer algorithm~\cite{jiang} solves the on-chain one-hop swap routing problem. In \cite{jiang}, the convergence is proved but the convergence rate is left open. We prove that the algorithm terminates in at most $\mathcal{O}(Nκ\log\frac{1}{\varepsilon})$ rounds, where $N$ is the number of AMMs, $κ$ a liquidity heterogeneity parameter and $\varepsilon$ a tolerance parameter. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_27172 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On the Convergence Rate of the One-Hop Transfer Algorithm Jiang, Ruichao Wen, Long Optimization and Control The transfer algorithm~\cite{jiang} solves the on-chain one-hop swap routing problem. In \cite{jiang}, the convergence is proved but the convergence rate is left open. We prove that the algorithm terminates in at most $\mathcal{O}(Nκ\log\frac{1}{\varepsilon})$ rounds, where $N$ is the number of AMMs, $κ$ a liquidity heterogeneity parameter and $\varepsilon$ a tolerance parameter. |
| title | On the Convergence Rate of the One-Hop Transfer Algorithm |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2603.27172 |