This paper introduces STAP to measure DEX efficiency and shows better routing algorithms increase DEX performance and stakeholder benefits.
problem Measuring and improving the efficiency of decentralized exchanges (DEXs).
method Introduces STAP as a measure of DEX efficiency and compares two routing algorithms.
result Better routing algorithms improve DEX efficiency and stakeholder benefits.
Study finds average 2.02 bps loss in automated market maker routing.
problem Measuring sub-optimality in automated market maker routing.
method Three reproducible optimal benchmarks: SCO, FVO, G-FVO; bisection-based algorithm for optimal routing.
result Average 2.02 bps loss per trade, \$24 million total loss.
LG algorithm finds profitable trading paths in decentralized exchanges.
problem Identifying optimal trading paths in decentralized exchanges.
method Line-graph-based algorithm (LG) for efficient route discovery.
result LG consistently identifies more profitable paths than DFS with comparable costs.
Faster Ethereum slots boost CEX-DEX arbitrage by 535% and 203%.
problem Reducing Ethereum slot time impacts CEX-DEX arbitrage opportunities.
method Developed a trading model to simulate and compare agent behavior under different slot times.
result Faster slot times increase CEX-DEX arbitrage activity and returns.
Study compares costs and arbitrage in CEXs vs DEXs, finding DEXs better for large trades.
problem Comparing transaction costs and arbitrage in crypto exchanges.
method Comprehensive dataset analysis of transaction costs and no-arbitrage deviations.
result Fixed gas fees in DEXs impose a significant burden on small trades, while CEXs offer more competitive costs for larger trades.
The paper analyzes CEX-DEX arbitrage and profitability on Ethereum, revealing centralization trends and market impacts.
problem Ethereum's decentralization and CEX-DEX arbitrages.
method Empirical analysis of 19 months' data from 7.2M CEX-DEX transactions, refining heuristics to identify and estimate arbitrage revenue.
result Three searchers captured three-quarters of volume and extracted value, and profitability is tied to integration with block builders.
Optimal trading strategy between CEXs and DEXs with priority fees and stochastic delays.
problem Managing latency risk in trading between centralized and decentralized exchanges.
method Developed a mixed control framework combining absolutely continuous controls with impulse interventions, allowing for stochastic execution delays and multiple pending orders.
result Optimal priority fee selection significantly outperforms non-strategic fee selection.
This paper studies liquidity providers in decentralized exchanges.
problem Understanding how liquidity providers behave in DEXes.
method Analyzed operations on Uniswap, measured investment strategy, returns, and risks.
result Liquidity providers benefit from transaction fees and determine their strategy based on market changes.
QubitSwap improves DEX efficiency by reducing impermanent loss and slippage.
problem Challenges in decentralised exchanges, especially impermanent loss and slippage.
method Hybrid approach integrating external oracle price with internal pool dynamics, parameterized by z. result Reduction in impermanent loss and slippage compared to traditional DEX frameworks.
A game-theoretic analysis of DEX competition through dynamic trading fees.
problem Competition between decentralized exchanges (DEXs) and their impact on trading fees and slippage.
method Characterization of an approximate Nash equilibrium via coupled system of partial differential equations and closed-form expressions for equilibrium fees.
result The equilibrium trading fees shift from the oracle price to a weighted average of the oracle and competitors' exchange rates under competition.
Market inefficiencies persist in DEXes, especially during high volatility.
problem Inefficiencies in decentralized exchanges during high volatility.
method Analyzed 30% of trades, tracked price inaccuracies, and observed market adaptability.
result Market inefficiencies persist, especially during high volatility.
This paper introduces Dex, a reinforcement learning environment toolkit specialized for training and evaluation of continual learning methods as well as general reinforcement learning problems. We also present the novel continual learning method of incremental learning, where a challenging environment is solved using o…
Study factors affecting liquidity on decentralized exchanges, introducing new metrics.
problem Understanding and predicting liquidity on decentralized exchanges (DEXs).
method Analyzes platform, blockchain, token pair, and liquidity pool factors; introduces new metrics.
result Identifies how various factors affect liquidity through concentration and total value locked.
Exchanges acquire excess processing capacity to accommodate trading activity surges associated with zero-sum high-frequency trader (HFT) "duels." The idle capacity's opportunity cost is an externality of low-latency trading. We build a model of decentralized exchanges (DEX) with flexible capacity. On DEX, HFTs acquire …
DECS tool assesses swap rates of DEXes and Fusion outperforms competitors.
problem Lack of unbiased swap rate comparisons in decentralized finance.
method Swap transaction monitoring and simulation techniques.
result 1inch Classic and Fusion consistently outperform competitors in swap rates.
This research compiles knowledge on decentralized exchanges with AMM protocols.
problem Improving and developing AMM-based decentralized exchanges.
method Established a general AMM framework, compared mechanics, discussed security and privacy.
result Illustrated conservation and slippage functions of AMM protocols.
Algorithmic trading systems on DEXs reject most candidate tokens, but the counterfactual outcome of rejected candidates is rarely measured.
problem Measuring the counterfactual outcome of rejected tokens in algorithmic trading systems on decentralized exchanges.
method Post-Rejection Follow-up Sampling (PRFS) introduces a methodology for collecting and analyzing the data needed to evaluate filter precision against actual market outcomes of rejected candidates.
result PRFS produces the data needed to evaluate filter precision against actual market outcomes of rejected candidates, not against synthetic backtest reconstructions.
Uniswap V3 requires more decisions from liquidity providers, making it complex and risky.
problem Complexity and risk in liquidity provision on Uniswap V3.
method Developed a theoretical model and analyzed real data.
result Liquidity provision on Uniswap V3 is highly complex and risky.
Non-atomic arbitrage exploits price differences on Ethereum and other blockchains, accounting for over 10% of Ethereum's block value.
problem Price differences on decentralized exchanges and centralized exchanges lead to MEV.
method Analyzed non-atomic arbitrage on Ethereum's largest DEXes, identifying its prevalence and impact.
result More than 10% of Ethereum's block value is attributed to non-atomic arbitrage, involving over $132 billion.
Study examines stylized facts in DEX markets vs. traditional exchanges.
problem Comparing stylized facts in decentralized exchanges (DEXs) vs. traditional markets.
method Empirical analysis of 24 most active Uniswap v3 pools.
result New statistical regularities in DEX markets, linked to market structure and activity.
Modeling DEX liquidity with heterogeneous LPs and MEV bots.
problem Understanding and predicting the dynamics of decentralized cryptocurrency exchanges.
method Mean-field game approach to model liquidity providers' optimal strategies and interactions.
result Calibrated model produces consistent pool exchange rate dynamics and liquidity evolution.
CFMMs solve complex multi-asset trades via convex optimization.
problem Complex multi-asset trades in decentralized exchanges.
method Formulate multi-asset trades as convex optimization problems.
result Efficiently solve multi-asset trades using convex optimization.
This study examines how DEXs impact traders' behavior in perpetual futures contracts.
problem Understanding trader behavior in decentralized exchanges.
method Categorizing DEX models and analyzing their impact on trading patterns.
result DEXs, particularly those using VAMM, show differential effects on long and short positions.
Study compares Web3 tokens to traditional assets, finding similar statistical properties.
problem Understanding statistical properties of Web3 tokens compared to traditional financial assets.
method Statistical analysis of various Web3 tokens across multiple time scales, comparing with traditional financial assets.
result Most Web3 tokens exhibit similar stylized facts to traditional financial assets, including heavy tails and volatility clustering.
The paper investigates cyclic arbitrage opportunities in decentralized exchanges.
problem Price discrepancies in decentralized exchanges lead to arbitrage opportunities.
method Theoretical framework and analysis of transaction-level data.
result Traders have executed over 292,606 cyclic arbitrages over eleven months, exploiting more than 138 million USD in revenue.
Study liquidity provision in decentralized exchanges considering risk aversion and replication costs.
problem Economic viability of liquidity provision in decentralized exchanges (DEXs).
method Formulated strategic interactions as a sequential game with risk-averse LP, traders, and arbitrageurs.
result DEX liquidity depth is crucial for risk management, influenced by risk aversion and replication costs.
Study examines trading costs on Uniswap, finding adversarial slippage is significant for large trades and certain assets.
problem Analyzing costs and slippage in decentralized exchanges (DEXs).
method Empirical evaluation of Uniswap's USDC-ETH and PEPE-ETH pools, calculating slippage and reordering slippage.
result Adversarial slippage is significant for large trades and certain assets like PEPE.
New algorithm finds more arbitrage opportunities in DEXs.
problem Detecting arbitrage loops and non-loops in decentralized exchanges.
method Combining line graph and modified Moore-Bellman-Ford algorithm.
result Found more arbitrage loops and non-loops compared to existing methods.
DQN outperforms static policies in a dynamic fee environment for automated market makers.
problem How automated market makers (AMMs) perform under dynamic fees is unknown.
method Constructed a closed-loop simulator with dynamic fees, noise flow, and arbitrage.
result A small DQN policy outperforms static policies in a dynamic fee environment.
Capsule networks improve performance on image classification tasks with fewer parameters.
problem Improving performance of capsule networks with fewer parameters.
method Inverted dot-product attention routing, Layer Normalization, concurrent iterative routing.
result Improves performance on benchmark datasets CIFAR-10 and CIFAR-100, and performs at-par with ResNet-18.
Route Choice Models predict the route choices of travelers traversing an urban area. Most of the route choice models link route characteristics of alternative routes to those chosen by the drivers. The models play an important role in prediction of traffic levels on different routes and thus assist in development of ef…
JAMPR learns to solve complex VRP with time windows.
problem Vehicle routing problems with time windows and vehicle capacities.
method Joint attention to construct multiple routes concurrently.
result JAMPR outperforms existing models on different problem sizes.
The paper audits trading filters, finding a high save-to-miss ratio.
problem Improving the efficiency and accuracy of trading filters in decentralized exchanges.
method A precision audit of filter rules against real trading data, classifying rejection events.
result Conservative save-to-miss ratio of 3.7 : 1, with wider interpretation of 14.8 : 1.
A large GPS dataset reveals that a single route often covers 60% of travel observations.
problem Limited insights from small GPS datasets on route choice behavior.
method Evaluation of path generation algorithms including link penalty, link elimination, simulation, and via-node methods.
result Modified link penalty method achieves 97% coverage, significantly higher than previous studies.
Global routing has been a historically challenging problem in electronic circuit design, where the challenge is to connect a large and arbitrary number of circuit components with wires without violating the design rules for the printed circuit boards or integrated circuits. Similar routing problems also exist in the de…
We propose and systematically evaluate three strategies for training dynamically-routed artificial neural networks: graphs of learned transformations through which different input signals may take different paths. Though some approaches have advantages over others, the resulting networks are often qualitatively similar…
A new router uses attention-based reinforcement learning to solve detailed routing problems efficiently.
problem Solving detailed routing in integrated circuits while adhering to complex design rules.
method Attention-based reinforcement learning applied to track-assignment detailed routing.
result The attention router achieves over 100x acceleration compared to a genetic router without sacrificing solution quality.
The DEBS Grand Challenge 2018 is set in the context of maritime route prediction. Vessel routes are modeled as streams of Automatic Identification System (AIS) data points selected from real-world tracking data. The challenge requires to correctly estimate the destination ports and arrival times of vessel trips, as ear…
Unified routing and arbitrage with concave continuation.
problem Combining routing and arbitrage in financial markets.
method Extending AMM trade functions to negative inputs via concave continuation.
result Unified approach unifies routing and arbitrage.
A new approach integrates inventory prediction and routing optimization for better supply chain management.
problem Optimizing efficient route selection in supply chain management with uncertain inventory demand.
method Decision-focused learning approach using neural networks to directly integrate inventory prediction and routing optimization.
result Direct integration of inventory prediction and routing optimization leads to better supply chain decisions.
Sparse routing networks with co-training prevent catastrophic forgetting in continual learning.
problem Catastrophic forgetting in neural networks trained on a sequence of tasks.
method Sparse routing networks with co-training to minimize interference between dissimilar tasks.
result Sparse routing networks with co-training outperform densely connected networks on benchmarks.
Neural LNS improves vehicle routing performance.
problem Optimizing vehicle routes with constraints.
method Integrates deep learning with large neighborhood search.
result Significantly outperforms existing methods on CVRP.
Polestar optimizes public transportation routes for efficiency and user satisfaction.
problem Difficulty in finding optimal public transportation routes due to complex networks and dynamic situations.
method Developed a Public Transportation Graph (PTG) and a route search algorithm with station binding and ranking modules.
result Demonstrated superior efficiency and user satisfaction compared to existing systems.
A recently proposed method in deep learning groups multiple neurons to capsules such that each capsule represents an object or part of an object. Routing algorithms route the output of capsules from lower-level layers to upper-level layers. In this paper, we prove that state-of-the-art routing procedures decrease the e…
Capsules are the multidimensional analogue to scalar neurons in neural networks, and because they are multidimensional, much more complex routing schemes can be used to pass information forward through the network than what can be used in traditional neural networks. This work treats capsules as collections of neurons …
We derive a formula for liquidity providers' payoff on DEXs, linking it to volatility.
problem Liquidity providers on DEXs are undercompensated for their service.
method We derive a payoff formula for liquidity providers on DEXs, assuming geometric Brownian price movements and zero arbitrage.
result The payoff from liquidity fees is a near-linear function of volatility.
Capsule networks improve at detecting changes in compositionality with routing.
problem Capsule networks struggle with detecting changes in compositionality.
method Introduced a loss function based on routing entropy to improve compositionality.
result Capsule networks with the new loss function better detect changes in compositionality.
This study develops methods to coordinate travel routes to reduce congestion.
problem Coordination of travel routes to reduce urban traffic congestion.
method Developed mathematical approaches to quantify coordination potential and adaptive centroid-based clustering algorithm (ACCA).
result ACCA efficiently forms proper coordination groups for CB-CRM, improving efficiency with minimal performance loss.