RediSwap: MEV Redistribution Mechanism for CFMMs

• URL: http://arxiv.org/abs/2410.18434v1
• Date: Thu, 24 Oct 2024 05:11:41 GMT
• Title: RediSwap: MEV Redistribution Mechanism for CFMMs
• Authors: Mengqian Zhang, Sen Yang, Fan Zhang,
• Abstract summary: 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.
• Score: 6.475701705193783
• License:
• Abstract: Automated Market Makers (AMMs) are essential to decentralized finance, offering continuous liquidity and enabling intermediary-free trading on blockchains. However, participants in AMMs are vulnerable to Maximal Extractable Value (MEV) exploitation. Users face threats such as front-running, back-running, and sandwich attacks, while liquidity providers (LPs) incur the loss-versus-rebalancing (LVR). In this paper, we introduce RediSwap, a novel AMM designed to capture 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 formalize the mechanism design problem and the desired game-theoretical properties. A central insight underpinning our mechanism is the interpretation of the maximal MEV value as the sum of LVR and individual user losses. We prove that our mechanism is incentive-compatible and Sybil-proof, and demonstrate that it is easy for arbitrageurs to participate. We empirically compared RediSwap with existing solutions by replaying historical AMM trades. Our results suggest that RediSwap can achieve better execution than UniswapX in 89% of trades and reduce LPs' loss to under 0.5% of the original LVR in most cases.

Related papers

• Read-ME: Refactorizing LLMs as Router-Decoupled Mixture of Experts with System Co-Design [59.00758127310582]
  We propose a novel framework Read-ME that transforms pre-trained dense LLMs into smaller MoE models. Our approach employs activation sparsity to extract experts. Read-ME outperforms other popular open-source dense models of similar scales.
  arXiv  Detail & Related papers  (2024-10-24T19:48:51Z)
• Designing Redistribution Mechanisms for Reducing Transaction Fees in Blockchains [10.647087323578477]
  Transaction Fee Mechanisms (TFMs) determine which user transactions to include in blocks and determine their payments. We propose Transaction Fee Redistribution Mechanisms (TFRMs) -- redistributing VCG payments as rebates to minimize transaction fees. Our results show that TFRMs provide a promising new direction for reducing transaction fees in public blockchains.
  arXiv  Detail & Related papers  (2024-01-24T07:09:32Z)
• 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)
• Onchain Sports Betting using UBET Automated Market Maker [45.410818354926406]
  Decentralized sports betting requires automated market makers (AMMs) for efficient liquidity provision. Existing AMMs like Uniswap lack alignment with fair odds, creating risks for liquidity providers. The paper introduces UBET AMM (UAMM), utilizing smart contracts and algorithms to price sports odds fairly.
  arXiv  Detail & Related papers  (2023-08-18T02:19:30Z)
• Semantic Information Marketing in The Metaverse: A Learning-Based Contract Theory Framework [68.8725783112254]
  We address the problem of designing incentive mechanisms by a virtual service provider (VSP) to hire sensing IoT devices to sell their sensing data. Due to the limited bandwidth, we propose to use semantic extraction algorithms to reduce the delivered data by the sensing IoT devices. We propose a novel iterative contract design and use a new variant of multi-agent reinforcement learning (MARL) to solve the modelled multi-dimensional contract problem.
  arXiv  Detail & Related papers  (2023-02-22T15:52:37Z)
• 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)
• QLAMMP: A Q-Learning Agent for Optimizing Fees on Automated Market Making Protocols [5.672898304129217]
  We develop a Q-Learning Agent for Market Making Protocols (QLAMMP) that learns the optimal fee rates and leverage coefficients for a given AMM protocol. We show that QLAMMP is consistently able to outperform its static counterparts under all the simulated test conditions.
  arXiv  Detail & Related papers  (2022-11-28T00:30:45Z)
• Predictive Crypto-Asset Automated Market Making Architecture for Decentralized Finance using Deep Reinforcement Learning [0.0]
  The study proposes a quote-driven predictive automated market maker (AMM) platform with on-chain custody and settlement functions. The proposed architecture is an augmentation to the Uniswap V3, a cryptocurrency AMM protocol, by utilizing a novel market equilibrium pricing for reduced divergence and slippage loss.
  arXiv  Detail & Related papers  (2022-09-28T01:13:22Z)
• Adaptive Stochastic ADMM for Decentralized Reinforcement Learning in Edge Industrial IoT [106.83952081124195]
  Reinforcement learning (RL) has been widely investigated and shown to be a promising solution for decision-making and optimal control processes. We propose an adaptive ADMM (asI-ADMM) algorithm and apply it to decentralized RL with edge-computing-empowered IIoT networks. Experiment results show that our proposed algorithms outperform the state of the art in terms of communication costs and scalability, and can well adapt to complex IoT environments.
  arXiv  Detail & Related papers  (2021-06-30T16:49:07Z)
• BERTifying the Hidden Markov Model for Multi-Source Weakly Supervised Named Entity Recognition [57.2201011783393]
  conditional hidden Markov model (CHMM) CHMM predicts token-wise transition and emission probabilities from the BERT embeddings of the input tokens. It fine-tunes a BERT-based NER model with the labels inferred by CHMM.
  arXiv  Detail & Related papers  (2021-05-26T21:18:48Z)

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.