Improves personalized treatment selection using covariates.
problem Ranking and selecting the best alternative based on covariates.
method Linear model for covariate effects, two-stage procedures for error types, generalized slippage configuration.
result Procedures provide statistical guarantees for correct selection.
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.
A new framework assesses liquidity risk in perpetual futures exchanges.
problem Measuring and predicting liquidation execution risk in perpetual futures markets.
method Slippage-at-Risk (SaR) framework, comprising three metrics: cross-sectional slippage quantile, expected slippage, and aggregate dollar-denominated tail slippage.
result SaR provides a forward-looking assessment of liquidation execution risk, predictive of systemic stress.
Optimal trading patterns adjust based on market efficiency and slippage costs.
problem Balancing active alphas and trading costs in active portfolios.
method Maximization of utility including projected alpha-based profits, slippage costs, and risk aversion.
result Optimal trading involves a no-trade zone width that scales as Δ∼c1/2, differing from stochastic settings. 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 note on setting swap parameters for traders.
problem Determining optimal slippage parameters and trade size for wealth swapping.
method Theoretical solution and framework for optimal slippage parameters and trade size.
result Offers a method to solve optimal slippage parameters and trade size for wealth swapping.
A dealer manages quotes and rejection rules to control slippage risk in FX markets.
problem Managing inventory risk and latency risk in OTC FX market making.
method Dynamic programming and adiabatic-quadratic approximation to optimize quotes and rejection rules.
result Developed a method to optimize quotes and rejection rules for managing slippage risk.
Robotic grasp stability improved with fingertip slippage detection.
problem Improving grasp stability in robotic manipulation.
method Task-relevant feature extraction and efficient classifier design for fingertip slippage detection.
result The proposed method effectively detects object slippage with fingertips in an online fashion.
A new method to dynamically manage dark liquidity to balance capturing available liquidity and protecting from signalling.
problem Limiting access to dark venues and imposing minimum fill sizes restricts liquidity and can lead to excessive signalling.
method Dynamic monitoring of dark liquidity on a per fill basis, allowing real-time adjustments to trading exposure.
result The method allows traders to maximize available liquidity while protecting from excessive signalling.
The paper models market dynamics using a limit order book system to explain slippage and inefficiency.
problem Inefficiency in matching markets due to structural liquidity constraints and slippage.
method Introduces a market microstructure framework with a latent preference state matrix and a dynamic discrete choice execution model.
result Persistent slippage and regional invariance of preference orderings are explained by liquidity thresholds.
UAMM uses external market prices to improve AMM efficiency and reduce liquidity provider risk.
problem Traditional AMMs lack consideration of external markets and risk management.
method UAMM calculates prices by incorporating external market prices and impermanent loss, maintaining constant product curve properties.
result UAMM eliminates arbitrage opportunities when external market prices are efficient, reducing liquidity provider risk.
AutoQuant addresses cryptocurrency backtesting fragility by modeling execution costs and improving strategy selection.
problem Fragile backtests of cryptocurrency perpetual futures ignoring microstructure frictions and execution costs.
method Execution-centric framework with Bayesian optimization, double screening, and strict T+1 semantics.
result Fee-only and zero-cost backtests overestimate returns, highlighting the importance of modeling execution costs.
Method uses derivatives for dynamic index tracking and risk control.
problem Dynamic index tracking and risk exposure control using financial derivatives.
method Continuous-time diffusion framework, pathwise approach to construct dynamic portfolios of derivatives.
result Established a general tracking condition and derived a slippage process.
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.
Detecting real-time price impact in algo trading
problem Identifying the impact of traders' actions on market prices
method Measuring timing synchronicity between trader actions and adverse market events
result Detecting price impact on a per-action basis
Blockchain scaling reduces gas fees, allowing more frequent liquidity updates and concentration.
problem Adverse selection risk and high gas fees on decentralized exchanges.
method Instrumental variables analysis using blockchain scaling solutions (Arbitrum, Polygon) as instruments.
result Higher repositioning intensity and precision lead to greater liquidity concentration, benefiting small trades.
Optimizes trading in CFMMs and exchanges using deep learning.
problem Optimizing trading strategies in CFMMs and exchanges.
method Develops a model accounting for interaction between CFMMs and exchanges, employs deep Galerkin method to solve dynamic programming equation.
result Optimal strategy outperforms naïve strategies and is not prone to price slippage.
We refine toxicity bounds for dynamic liquidation incentives in CP-AMM systems.
problem Ensuring stability in dynamic liquidation incentives in automated market makers.
method Derived state-dependent toxicity bounds for dynamic liquidation incentives, reconciling them with CP-AMM price dynamics.
result State-dependent bounds and liquidity-depth-only condition for dynamic liquidation incentives.
The paper proposes a new order slicing strategy to reduce market impact in large-volume trading.
problem Significant market impact and slippage in large-volume trading.
method Volatility-volume-based order slicing strategy using Exponential Weighted Moving Average and Markov Chain Monte Carlo simulations.
result Improves trade execution efficiency and reduces market impact.
Paper presents a modular RL framework for Forex trading, addressing limitations of prior studies.
problem Challenges in applying RL to Forex trading, including unrealistic environments, simplified rewards, and restricted action spaces.
method Integrates three components: a friction-aware execution engine, a decomposable reward architecture, and a discrete action interface.
result Empirical evaluation shows strong non-monotonic reward interactions and optimal Sharpe ratio with the full reward configuration.
Study proposes deep learning for VWAP execution in crypto markets, outperforming traditional methods.
problem Challenges in achieving VWAP due to dynamic volume and price factors.
method Direct optimization of VWAP execution using deep learning, bypassing volume curve prediction.
result Deep learning approach consistently achieves lower VWAP slippage in volatile markets.
This paper examines the uniform properties of AMMs in cryptocurrency markets.
problem Theoretical uniformity of AMMs despite diverse strategies.
method Derives a universal formula for liquidity provisioning and compares models.
result Constant function and token swap models are equivalent under uniform liquidity.
MPC framework reduces execution costs and schedule deviations in trading.
problem Executing large orders in markets under time and liquidity constraints.
method Model Predictive Control (MPC) framework balancing order completion, market impact, and opportunity cost.
result Significant reductions in slippage and schedule shortfall compared to benchmarks.
Enhances crypto-asset AMM with deep learning for better liquidity and efficiency.
problem Reduced slippage and improved liquidity in decentralized finance.
method Deep reinforcement learning for predicting market equilibrium and optimizing liquidity.
result Improved capital efficiency and reduced slippage for crypto-asset traders.
MAP-Elites generates diverse trading strategies for improved execution performance.
problem Optimizing trading execution schedules in volatile market conditions.
method Quality-diversity algorithm (MAP-Elites) generating a portfolio of specialized strategies.
result Diverse strategies achieve 8-10% performance improvements, validating quality-diversity methods.
Hybrid method uses GP models to control robot trajectories.
problem Minimizing unmodeled dynamics in robot motion.
method Embeds non-parametric statistical models (GPs) for feedback control.
result Proposed method avoids complex analysis for wide trajectory classes.
Buying or selling assets leads to transaction costs for the investor. On one hand, it is well know to all market practionaires that the transaction costs are positive on average and present therefore systematic loss. On the other hand, for every trade, there is a buy side and a sell side, the total amount of asset and …
Algorithm recommends trades based on crypto asset prices and market conditions.
problem Optimizing trades in volatile crypto markets to minimize gas fees and slippage.
method Cascading Waterfall Round Robin Mechanism considering gas fees and slippage.
result Algorithmic approach reduces market noise and ensures sound trade execution.
AI traders learn to exploit meta-orders from slower traders, increasing their profits.
problem Adverse selection of medium-frequency traders by high-frequency AI agents.
method Reinforcement learning in a Hawkes LOB model, with impulse control and PPO.
result AI agents can learn to capitalize on meta-orders, increasing their profits.
Derives a size premium from automated market makers in decentralized AI subnets.
problem Determining the profitability and risk of decentralized AI subnets.
method Analyzes daily data on 128 subnets, tests the size premium, and calculates transaction costs.
result The size premium is reduced by a halving of token emissions but remains profitable only below a certain asset threshold.
Short-term incentives lead to riskier trading strategies.
problem Optimal execution with performance barriers.
method Analyzes the impact of short-term performance incentives on trading behavior.
result Short-term incentives result in more aggressive but less risky trading strategies in the short term, but poorer performance over long periods.
Market impact game analyzed with stochastic parameters using FBSDEs.
problem Analyzing Nash equilibrium in a market impact game with stochastic parameters.
method Characterizes Nash equilibrium using fully coupled FBSDEs and provides conditions for their unique solution.
result Unique Nash equilibrium found and characterized in terms of FBSDEs.
Computes fundamental groups of restricted configuration spaces.
problem Understanding the structure of configuration spaces after removing hypersurfaces.
method Fibration over unordered configuration spaces of n−1 points, computation of fundamental groups. result Fundamental groups of restricted configuration spaces computed in small dimensions.
We study the problem of optimal execution of a trading order under Volume Weighted Average Price (VWAP) benchmark, from the point of view of a risk-averse broker. The problem consists in minimizing mean-variance of the slippage, with quadratic transaction costs. We devise multiple ways to solve it, in particular we stu…
We study the configuration space of equilateral and equiangular spatial hexagons for any bond angle by giving explicit expressions of all the possible shapes. We show that the chair configuration is isolated, whereas the boat configuration allows one-dimensional deformations which form a circle in the configuration spa…
Study shows configuration spaces' homological dimension increases monotonically.
problem Understanding the homological properties of configuration spaces of manifolds.
method Analyzing the homological monotonicity of unordered configuration spaces of manifolds.
result Homological dimension of configuration spaces increases monotonically in each degree.
We consider the Brownian market model and the problem of expected utility maximization of terminal wealth. We, specifically, examine the problem of maximizing the utility of terminal wealth under the presence of transaction costs of a fund/agent investing in futures markets. We offer some preliminary remarks about stat…
Researchers create a model for surface point configurations.
problem No existing models for surface configuration spaces.
method Constructed a discrete combinatorial model for an oriented surface.
result Homotopy equivalence between configuration space and subcomplex of cube complex.
LeapsAndBounds configures solvers efficiently for unknown problem distributions.
problem Configuring general-purpose solvers to run efficiently on unknown problem instances.
method LeapsAndBounds tests configurations on randomly selected problem instances for longer and longer time.
result LeapsAndBounds achieves a runtime close to the optimal expected runtime with near-optimal running time.
Tripod configurations of plane curves, formed by certain triples of normal lines coinciding at a point, were introduced by Tabachnikov, who showed that C2 closed convex curves possess at least two tripod configurations. Later, Kao and Wang established the existence of tripod configurations for C2 closed locally c…
This paper extends homological stability results for configuration spaces of manifolds.
problem Homological stability of configuration spaces of manifolds.
method Analyzing the cohomology of configuration spaces of manifolds, focusing on stability in odd and even degrees.
result The stable range for homology groups of configuration spaces depends on the dimension of the manifold and the number of configuration points.
We study the Orchard relation for generic configurations of points in the plane (also called order types). We introduce infinitesimally-close points and analyse the relation of this notion with the Orchard relation. The second part of the paper deals with monochromatic configurations (for the Orchard relation). We give…
Quantum groups created from disk configuration space homologies.
problem Creating quantum groups from algebraic structures.
method Reconstructing quantum groups from homologies of configuration spaces of disks.
result New combinatorics and actual submanifolds of configuration spaces.
The paper calculates topological complexity for non-tree graphs and banana graphs.
problem Determining topological complexity for non-tree graphs and banana graphs.
method Analyzes fully articulated graphs and banana graphs, completing previous results for trees.
result Shows that unordered configuration spaces can have lower topological complexity than ordered ones.
Efficiently selects best machine learning config from large dataset.
problem Finding the best machine learning configuration from a large dataset.
method CI-based progressive sampling and pruning strategy.
result Achieves more than two orders of magnitude speedup while maintaining similar accuracy.
Configurations on Heisenberg group are flat surfaces.
problem Characterizing equidistant triples on the Heisenberg group.
method Proved isomorphism to a hypersurface in R^3.
result Configuration space is a flat surface.
Study calculates rational homology groups of configuration spaces for a Moebius strip and a projective plane.
problem Calculating rational homology groups of configuration spaces for specific topological spaces.
method Explicit calculation of all rational homology groups.
result All rational homology groups of configuration spaces for the Moebius strip and projective plane are determined.
We study configurations of immersed curves in surfaces and surfaces in 3-manifolds. Among other results, we show that primitive curves have only finitely many configurations which minimize the number of double points. We give examples of minimal configurations not realized by geodesics in any hyperbolic metric.