Short Paper: Atomic Execution is Not Enough for Arbitrage Profit Extraction in Shared Sequencers

• URL: http://arxiv.org/abs/2410.11552v3
• Date: Sun, 02 Mar 2025 16:13:52 GMT
• Title: Short Paper: Atomic Execution is Not Enough for Arbitrage Profit Extraction in Shared Sequencers
• Authors: Maria Inês Silva, Benjamin Livshits,
• Abstract summary: We develop a model to assess arbitrage profits under atomic execution across two Constant Product Market Marker liquidity pools.<n>We also discuss some scenarios where atomicity may lead to losses, offering insights into why atomic execution may not be enough to convince arbitrageurs and rollups to adopt shared sequencing.
• Score: 10.73653653756456
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: There has been a growing interest in shared sequencing solutions, in which transactions for multiple rollups are processed together. Their proponents argue that these solutions allow for better composability and can potentially increase sequencer revenue by enhancing MEV extraction. However, little research has been done on these claims, raising the question of understanding the actual impact of shared sequencing on arbitrage profits, the most common MEV strategy in rollups. To address this, we develop a model to assess arbitrage profits under atomic execution across two Constant Product Market Marker liquidity pools and demonstrate that switching to atomic execution does not always improve profits. We also discuss some scenarios where atomicity may lead to losses, offering insights into why atomic execution may not be enough to convince arbitrageurs and rollups to adopt shared sequencing.

Related papers

• Matching Multiple Experts: On the Exploitability of Multi-Agent Imitation Learning [51.77462571479799]
  Multi-agent imitation learning (MA-IL) aims to learn optimal policies from expert demonstrations of interactions in multi-agent interactive domains.<n>Despite existing guarantees on the performance of the resulting learned policies, characterizations of how far the learned polices are from a Nash equilibrium are missing for offline MA-IL.
  arXiv  Detail & Related papers  (2026-02-24T15:38:11Z)
• How to Serve Your Sandwich? MEV Attacks in Private L2 Mempools [0.0]
  We study the feasibility, profitability, and prevalence of sandwich attacks on rollups with private mempools.<n>Our results suggest that sandwiching, while endemic and profitable on L1, is rare, unprofitable, and largely absent in rollups with private mempools.
  arXiv  Detail & Related papers  (2026-01-27T13:00:33Z)
• When KV Cache Reuse Fails in Multi-Agent Systems: Cross-Candidate Interaction is Crucial for LLM Judges [26.22728953485589]
  We show that efficiency gains do not transfer uniformly to judge-centric inference.<n>Across GSM8K, MMLU, and HumanEval, we find that reuse strategies that are effective for execution agents can severely perturb judge behavior.
  arXiv  Detail & Related papers  (2026-01-13T09:02:58Z)
• Robust Reinforcement Learning in Finance: Modeling Market Impact with Elliptic Uncertainty Sets [57.179679246370114]
  In financial applications, reinforcement learning (RL) agents are commonly trained on historical data, where their actions do not influence prices.<n>During deployment, these agents trade in live markets where their own transactions can shift asset prices, a phenomenon known as market impact.<n>Traditional robust RL approaches address this model misspecification by optimizing the worst-case performance over a set of uncertainties.<n>We develop a novel class of elliptic uncertainty sets, enabling efficient and tractable robust policy evaluation.
  arXiv  Detail & Related papers  (2025-10-22T18:22:25Z)
• Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade [14.182863671689836]
  Bilateral trade models the task of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations.<n>We study this problem from the perspective of a broker, in a regret minimization framework.<n>We propose a learning algorithm that guarantees a nearly tight $tildeO(sqrtT)$ regret when seller and valuations are drawn.
  arXiv  Detail & Related papers  (2025-09-26T16:42:05Z)
• First-Spammed, First-Served: MEV Extraction on Fast-Finality Blockchains [0.0]
  This research analyzes the economics of spam-based arbitrage strategies on fast-finality blockchains.<n>We show that splitting a profitable MEV opportunity into multiple small transactions is the optimal strategy for CEX-DEX arbitrageurs.<n>We find that reverted transactions cluster at the very top of blocks on fast rollups like Arbitrum and ZKsync, indicating an intense latency race and revealing the fragility of fee-based ordering.
  arXiv  Detail & Related papers  (2025-06-02T09:18:53Z)
• Pandora's Box: Cross-Chain Arbitrages in the Realm of Blockchain Interoperability [6.6477743808876895]
  We study two non-atomic cross-chain arbitrage strategies: Sequence-Independent Arbitrage (SIA) and Sequence-Dependent Arbitrage (SDA) We analyze the effectiveness of these strategies across nine blockchains over a one-year period from September 2023 to August 2024. These arbitrages generated a lower-bound profit of 9,496,115.28 USD from a total traded volume of 465,797,487.98 USD.
  arXiv  Detail & Related papers  (2025-01-28T23:04:50Z)
• RediSwap: MEV Redistribution Mechanism for CFMMs [6.475701705193783]
  We introduce RediSwap, a novel AMM designed to capture Maximal Extractable Value (MEV) at the application level and refund it fairly among users and liquidity providers. At its core, RediSwap features an MEV-redistribution mechanism that manages arbitrage opportunities within the AMM pool. We prove that our mechanism is incentive-compatible and Sybil-proof, and demonstrate that it is easy for arbitrageurs to participate.
  arXiv  Detail & Related papers  (2024-10-24T05:11:41Z)
• Quantifying Arbitrage in Automated Market Makers: An Empirical Study of Ethereum ZK Rollups [6.892626226074608]
  This work systematically reviews arbitrage opportunities between Automated Market Makers (AMMs) on ZK rollups, and Centralised Exchanges (CEXs) We propose a theoretical framework to measure such arbitrage opportunities and derive a formula for the related Maximal Arbitrage Value (MAV) Overall, the cumulative MAV from July to 2023 on the USDC-ETH SyncSwap pool amounts to $104.96k (0.24% of trading volume)
  arXiv  Detail & Related papers  (2024-03-24T10:26:34Z)
• Towards a Theory of Maximal Extractable Value II: Uncertainty [4.07926531936425]
  Maximal Extractable Value (MEV) is value extractable by temporary monopoly power commonly found in decentralized systems. This extraction stems from a lack of user privacy upon transaction submission and the ability of a monopolist validator to reorder, add, and/or censor transactions. We show that neither fair ordering techniques nor economic mechanisms can individually mitigate MEV for arbitrary payoff functions.
  arXiv  Detail & Related papers  (2023-09-25T15:01:11Z)
• Learning Multi-Agent Intention-Aware Communication for Optimal Multi-Order Execution in Finance [96.73189436721465]
  We first present a multi-agent RL (MARL) method for multi-order execution considering practical constraints. We propose a learnable multi-round communication protocol, for the agents communicating the intended actions with each other. Experiments on the data from two real-world markets have illustrated superior performance with significantly better collaboration effectiveness.
  arXiv  Detail & Related papers  (2023-07-06T16:45:40Z)
• Uniswap Liquidity Provision: An Online Learning Approach [49.145538162253594]
  Decentralized Exchanges (DEXs) are new types of marketplaces leveraging technology. One such DEX, Uniswap v3, allows liquidity providers to allocate funds more efficiently by specifying an active price interval for their funds. This introduces the problem of finding an optimal strategy for choosing price intervals. We formalize this problem as an online learning problem with non-stochastic rewards.
  arXiv  Detail & Related papers  (2023-02-01T17:21:40Z)
• Benefits of Permutation-Equivariance in Auction Mechanisms [90.42990121652956]
  An auction mechanism that maximizes the auctioneer's revenue while minimizes bidders' ex-post regret is an important yet intricate problem in economics. Remarkable progress has been achieved through learning the optimal auction mechanism by neural networks.
  arXiv  Detail & Related papers  (2022-10-11T16:13:25Z)
• Learn Continuously, Act Discretely: Hybrid Action-Space Reinforcement Learning For Optimal Execution [8.021077964915996]
  Reinforcement learning can help decide the order-splitting sizes. Key challenge lies in the "continuous-discrete duality" of the action space. We propose a hybrid RL method to combine the advantages of both.
  arXiv  Detail & Related papers  (2022-07-22T15:50:44Z)
• Deep Learning Statistical Arbitrage [0.0]
  We propose a unifying conceptual framework for statistical arbitrage and develop a novel deep learning solution. We construct arbitrage portfolios of similar assets as residual portfolios from conditional latent asset pricing factors. We extract the time series signals of these residual portfolios with one of the most powerful machine learning time-series solutions.
  arXiv  Detail & Related papers  (2021-06-08T00:48:25Z)
• Universal Trading for Order Execution with Oracle Policy Distillation [99.57416828489568]
  We propose a novel universal trading policy optimization framework to bridge the gap between the noisy yet imperfect market states and the optimal action sequences for order execution. We show that our framework can better guide the learning of the common policy towards practically optimal execution by an oracle teacher with perfect information.
  arXiv  Detail & Related papers  (2021-01-28T05:52:18Z)
• Weighted QMIX: Expanding Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning [66.94149388181343]
  We present a new version of a popular $Q$-learning algorithm for MARL. We show that it can recover the optimal policy even with access to $Q*$. We also demonstrate improved performance on predator-prey and challenging multi-agent StarCraft benchmark tasks.
  arXiv  Detail & Related papers  (2020-06-18T18:34:50Z)
• A Deep Reinforcement Learning Framework for Continuous Intraday Market Bidding [69.37299910149981]
  A key component for the successful renewable energy sources integration is the usage of energy storage. We propose a novel modelling framework for the strategic participation of energy storage in the European continuous intraday market. An distributed version of the fitted Q algorithm is chosen for solving this problem due to its sample efficiency. Results indicate that the agent converges to a policy that achieves in average higher total revenues than the benchmark strategy.
  arXiv  Detail & Related papers  (2020-04-13T13:50:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.