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.
This study optimizes trading and arbitrage in decentralized finance's CPMs, revealing convexity costs and developing efficient strategies.
problem Optimizing trading and arbitrage in decentralized finance's constant product markets (CPMs).
method Developed models for CPMs in competing centralised exchanges, CPMs, and both venues. Derived computationally efficient strategies.
result Accurately estimated convexity costs in CPMs, which are linear in trade size and nonlinear in liquidity depth and exchange rate.
Optimizes liquidations in decentralized finance to manage credit risk.
problem Managing and liquidating positions in decentralized finance exchanges.
method Formulated as an ergodic optimal control problem, derived closed-form solutions for optimal liquidation strategies.
result Closed-form solutions balance immediate executions with price impacts and long-term rewards.
The article provides formulas to hedge impermanent loss in decentralized markets.
problem Impermanent loss in concentrated liquidity provision in decentralized markets.
method Analytical characterizations and static replication formulas using European calls or puts.
result Static replication formulas accurately hedge impermanent loss.
Cryptofinance generates yield through innovative decentralized finance.
problem Lack of intrinsic yield in crypto-assets.
method Analysis of yield-generating mechanisms in cryptofinance.
result Cryptofinance innovations enable yield generation through various decentralized and centralised mechanisms.
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.
Paper analyzes constant-product market making protocols.
problem Understanding and optimizing constant-product market making.
method Mathematical analysis of trade splitting and fee recompounding.
result Splitting trades does not affect final exchange rate.
QMIX combines per-agent values to create decentralised policies.
problem Training decentralised policies from centralised learning.
method QMIX uses a mixing network to estimate joint action-values as a monotonic combination of per-agent values.
result QMIX significantly outperforms existing methods on the StarCraft Multi-Agent Challenge (SMAC).
Decentralised fund framework allocates capital via tokenised vaults.
problem Traditional asset management's inefficiencies and centralisation.
method Permissionless, multi-strategy capital allocation through on-chain vaults.
result Self-regulating, cooperative optimisation across financial domains.
In many real-world settings, a team of agents must coordinate their behaviour while acting in a decentralised way. At the same time, it is often possible to train the agents in a centralised fashion in a simulated or laboratory setting, where global state information is available and communication constraints are lifte…
FTX's failure linked to Terra-Luna collapse and Binance's influence.
problem FTX's collapse due to misuse of native token and reliance on leverage.
method Analyzed on-chain data, studied cryptocurrency dependency structures, and examined public trades.
result FTX's downfall was accelerated by Binance's tweets and public reaction.
RED-2400 is a public benchmark of trading events from a Solana exchange, labeled by algorithmic rejection.
problem Analyzing algorithmically-rejected trading events for insights into market dynamics.
method Public dataset of 6,660 algorithmically-rejected trading events, linked to post-rejection price and liquidity trajectories.
result First window of a planned series of datasets extending the time horizon and enabling regime-stratified analysis.
Decentralised optimisation tasks are important components of multi-agent systems. These tasks can be interpreted as n-player potential games: therefore game-theoretic learning algorithms can be used to solve decentralised optimisation tasks. Fictitious play is the canonical example of these algorithms. Nevertheless fic…
We analyse the learning performance of Distributed Gradient Descent in the context of multi-agent decentralised non-parametric regression with the square loss function when i.i.d. samples are assigned to agents. We show that if agents hold sufficiently many samples with respect to the network size, then Distributed Gra…
This paper introduces a new metric to improve the performance of AMMs over centralised exchanges.
problem Lack of a precise metric to compare AMM performance with centralised exchanges.
method Introduces Rebalancing-versus-Rebalancing (RVR) to measure AMM performance more accurately.
result AMMs can offer superior execution and rebalancing efficiency compared to centralised exchanges, even with low fees.
OpenAlpha validates decentralized capital strategies using game theory and market aggregation.
problem Decentralized capital management's lack of trust-minimised, adaptive deployment.
method Game-theoretic validation, adversarial auditing, market-based belief aggregation.
result Confidence scores from validation phases inform capital allocation rules.
Unified methods for hedging impermanent loss in decentralized exchanges.
problem Hedging impermanent loss in liquidity provision at decentralized exchanges.
method Static and dynamic approaches using arbitrage-based methods for valuation and risk management.
result Unified valuation and hedging formulas for IL protection claims.
DFMM automates market making with adaptive pricing and risk management.
problem Challenges in decentralised automated market making (AMMs).
method Data aggregator, order routing, rebalancing, arbitrageurs, protective buffers, algorithmic accounting.
result DFMM optimises inventory risk and ensures market stability.
The study examines how backrun auctions can protect traders from price manipulation.
problem Price manipulation by arbitrageurs in batched trading venues.
method Developed a laminated queueing model to study price manipulation and introduced a price manipulation coefficient.
result Bound the price manipulation coefficient and found it approximated by a 'zeta value' with measurable parameters.
It is now well known that decentralised optimisation can be formulated as a potential game, and game-theoretical learning algorithms can be used to find an optimum. One of the most common learning techniques in game theory is fictitious play. However fictitious play is founded on an implicit assumption that opponents' …
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.
The paper proposes a fair and private decentralized deep learning framework.
problem Ensuring fairness and privacy in collaborative deep learning.
method A reputation system and differential privacy are used. FDPDDL framework is built with two stages: initialisation and update.
result FDPDDL achieves high fairness, comparable accuracy to centralised and distributed frameworks, and better accuracy than standalone.
Paper optimizes liquidity provision in decentralized finance markets.
problem Strategic LPs face predictable losses and concentration risk in CL pools.
method Derive optimal liquidity provision strategy based on fees, PL, and concentration risk.
result Optimal strategy increases fee revenue and profit from marginal rate changes.
Distributed learning with random features and gradient descent improves performance and reduces memory usage.
problem Improving generalization in decentralized learning with limited memory.
method Distributed Gradient Descent with Random Features and Implicit Regularization.
result High probability bounds on predictive performance with optimal statistical rates.
Hour-Aware Adaptive Risk Management for Autonomous Memecoin Trading
problem Autonomous memecoin trading system performance
method Hour-of-day effects, filter precision, fragility
result 40.5% win rate, mean per-trade return of +0.62%, cumulative +117.7%
Study loan contracts in DLPs using derivatives pricing and neural networks.
problem Optimizing and hedging risks in decentralized lending contracts.
method Derivatives pricing theory, deep neural networks, and statistical arbitrage.
result Developed a method to hedge risks in lending contracts and exploit arbitrage opportunities.
Improved Q-learning for multi-agent reinforcement learning by weighting joint action values.
problem QMIX restricts Q-values to monotonic mixtures, limiting complex value functions. method Introduced weighted projection to recover optimal policies, improving performance.
result CW QMIX and OW QMIX outperform baseline QMIX on multi-agent tasks.
Optimal benchmark design varies based on costs in financial manipulation.
problem Manipulation of price benchmarks in finance.
method Analyzes empirical pattern and cost structures to determine optimal benchmark design.
result The optimal benchmark depends on the relative sizes of fixed and variable costs.
Examines multiagent systems for complex learning tasks.
problem Achieving cohesive learning behavior in multiagent networks.
method General formulation for multiagent dynamics and conditions for learning.
result Conditions for achieving cohesive learning behavior in multiagent networks.
The exchange algorithm is studied for its convergence and asymptotic variance.
problem Theoretical limitations of the exchange algorithm in sampling from doubly-intractable distributions.
method Theoretical analysis of the exchange algorithm's convergence speed and asymptotic variance.
result The exchange algorithm converges at a geometric rate and satisfies a Central Limit Theorem.
Study on pricing American Exchange options using Lévy processes.
problem Pricing American Exchange options driven by Lévy processes.
method Represented American Exchange options as European options plus early exercise premium; studied properties of free boundary and provided an approximative formula.
result Developed an approximative formula for American Exchange options.
Paper presents a risk management framework for blockchain protocols.
problem Blockchain protocol risks affecting DLT and digital assets.
method Developed a comprehensive risk management framework using traditional taxonomy.
result Structured approach to identify, measure, monitor and report blockchain protocol risks.
Optimal crypto order execution using cross-exchange signals.
problem Maximizing order execution efficiency in cryptocurrency markets.
method Reinforcement learning applied to cross-exchange data.
result Cross-exchange signals improve optimal execution outcomes.
Optimal dynamic fees found for AMMs to deter arbitrageurs and attract noise traders.
problem Optimizing fees in AMMs to balance against arbitrage and noise trading.
method Approximate closed-form solutions to control problem, study of fee structure.
result Two distinct fee regimes identified: high fees to deter arbitrage, low fees to attract noise traders.
A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is considered unrealistic in observed graphs. We define a notion of edge exchangeability …
How do individuals accumulate wealth as they interact economically? We outline the consequences of a simple microscopic model in which repeated pairwise exchanges of assets between individuals build the wealth distribution of a population. This distribution is determined for generic exchange rules --- transactions that…
The team predicts foreign exchange rates using clustering and attention models.
problem Complexity and unexpected events in foreign exchange markets.
method Clustering and attention models applied to historical data.
result Improved event-driven price prediction for oversold scenarios.
A dynamical model of capital exchange is introduced in which a specified amount of capital is exchanged between two individuals when they meet. The resulting time dependent wealth distributions are determined for a variety of exchange rules. For ``greedy'' exchange, an interaction between a rich and a poor individual r…
Study finds recurring patterns in cryptocurrency volatility and liquidity.
problem Recurring patterns in volatility and liquidity of major cryptocurrencies.
method Data from two centralized exchanges and a decentralized exchange analyzed for patterns.
result Systematic patterns in volatility and liquidity across different timeframes.
The article provides representations of exchange option prices under SVJD dynamics.
problem Modeling and pricing exchange options under stochastic volatility and jumps.
method Develops representations for European and American exchange options using SVJD dynamics and equivalent martingale measures.
result Derives integro-partial differential equations and representations for exchange option prices.
This paper introduces cluster exchange groupoids for Coxeter-Dynkin diagrams and finds their fundamental groups are braid groups.
problem Understanding the fundamental groups of cluster exchange groupoids for Coxeter-Dynkin diagrams.
method Introduced cluster exchange groupoids for Coxeter-Dynkin diagrams and showed the fundamental group isomorphic to braid groups.
result The fundamental group of the exchange groupoid for a Coxeter-Dynkin diagram is the braid group associated with the diagram.
To gain insights into the problem of regional inequality, we proposed new regional asset exchange models based on existing kinetic income-exchange models in economic physics. We did this by setting the spatial exchange range and adding bias to asset fraction probability in equivalent exchanges. Simulations of asset dis…
Study finds relevance of exchange and inflation rates to economic factors.
problem Determining the relevance of exchange and inflation rates to economic factors.
method Introduced concept of adequacy, established positive relation between exchange and inflation rates and other economic factors.
result Close positive relation found between exchange and inflation rates and other economic factors.
The article improves the display of acceptable exchange ratios for merging companies.
problem Determining feasible exchange ratios for merging companies.
method Exploits a diagrammatic approach to display the bargaining region.
result Shares face upper and lower bounds for acceptable exchange ratios.
Framework for systemic risk modeling using jointly exchangeable arrays.
problem Systemic risk in insurance portfolios with interactions.
method Jointly exchangeable arrays, central limit theorems, simulation-based validation.
result Asymptotic approximations for total portfolio losses in large portfolios over long time horizons.
Centralised training with decentralised execution is an important setting for cooperative deep multi-agent reinforcement learning due to communication constraints during execution and computational tractability in training. In this paper, we analyse value-based methods that are known to have superior performance in com…
Framework handles both exchangeable and non-exchangeable event sequences without tuning.
problem Handling both exchangeable and non-exchangeable event sequences efficiently.
method Parametric Hawkes-process-inspired conditional probability mass function with variational inference.
result Competitive computational and predictive performance against state-of-the-art methods.
Unified framework for representation and causal structure learning using exchangeable data.
problem Identifying latent representations or causal structures in non-i.i.d. data.
method Identifiable Exchangeable Mechanisms (IEM) framework for representation and structure learning.
result New insights and identifiability results for causal structure and representation learning.