Searcharxiv⌕ Search

arXiv · 2611.10586

M3FT: Micro-Macro-Micro Reasoning for Multi-Agent Cryptocurrency Perpetual Futures Trading

Abstract

Cryptocurrency perpetual futures form a large-scale online financial market in which automated agents manage interacting asset positions under changing conditions. Policies relying solely on micro-level numerical states may overlook cross-asset relationships and become vulnerable to regime shifts, while macro-level linguistic judgments alone cannot ensure precise measurement or optimize positions under trading costs and risk constraints. Connecting market interpretation to coordinated multi-asset decisions remains challenging. We propose M3FT, a micro-macro-micro framework for multi-agent perpetual futures trading. The first micro stage constructs time-aligned numerical states from exchange and account observations through deterministic processing. The macro stage transforms these measured states into explicit market interpretations without adding external market information. Four asset-specific teams, each comprising a Market Interpreter, an Asset Communicator, and a Risk Reviewer, refine these interpretations through experience retrieval, cross-asset communication, and review of joint-position risks. The final micro stage combines encoded linguistic representations with the original numerical states to learn continuous target positions. We implement this framework with a language-conditioned multi-agent policy: asset actors use global and private numerical states together with linguistic context, while centralized critics evaluate joint actions using portfolio-wide information and shared-account rewards. Experiments on real cryptocurrency perpetual futures data, including comparisons across language models and policy-learning algorithms and component ablations, show that the best-performing M3FT configuration achieves a higher mean test return than the evaluated direct LLM, numerical RL, and rule-based baselines.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiashun Wang, Beile Wang, Guangyan Gan, Wentao Zhang, Siguang Li, Shuo Sun, Yunbo Lu, Lin William Cong. 2026-11-07. M3FT: Micro-Macro-Micro Reasoning for Multi-Agent Cryptocurrency Perpetual Futures Trading. https://searcharxiv.com/abs/2611.10586

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Equilibrium decisions under partial observation: dynamical error bounds and information requirements

Reduced monitoring can preserve stable dynamics while changing an equilibrium decision. Motivated by heterogeneous urban-mobility indicator coverage, we study fixed linear observations of a nonlinear recovery flow coupled to a strategic fixed-point map, and ask when a decision based on the reduced model can be trusted. The main result is a joint certificate: bounds on trajectory tracking, equilibrium displacement and unresolved output dependence are assembled into one decision-margin error which, under a stated Gaussian observation model, yields a conservative one-sided test and an explicit information requirement for prescribed worst-case power. In the scalar experiment this requirement is sharp: when the effect does not exceed twice the error budget, no valid test has worst-case power above its size, however many observations are taken. A second result connects manifold-adapted observations to defect bounds through a locally invertible observation chart, while distinguishing observation initialisation from asymptotic phase initialisation. Supporting results, resting on established lumping, contraction and fixed-point theory, cover exact quotients, an observation-fibre obstruction and the dependence of recovery-time comparisons on the tolerance convention. Seven reproducible synthetic experiments examine each component. The results give conditional criteria for certifying partial monitoring and separate mathematical guarantees from empirical validation.

cs.MA↗

Even Loose Proximity Constraints Make Makespan-optimal Unlabeled Multi-agent Pathfinding Hard

We study $r$-Connected Unlabeled Multi-agent Pathfinding ($r$CUMAPF), a variant of MAPF where interchangeable agents have a proximity range $r\in \mathbb{N}$, and agents must form a single group in a given graph $G$ through limited-range communication at all times. The problem arises in fundamental applications such as self-reconfiguration and platooning, while standard MAPF does not capture proximity constraints. For the problem of finding a makespan-optimal solution, prior work shows NP-hardness for $r=1$ and polynomial-time solvability when $r$ is sufficiently large; the complexity for the intermediate case $2\le r$ is largely unknown. To narrow this gap, we show that finding a solution to $r$CUMAPF with makespan at most $2$ is NP-hard for $2\le r= O(|V|^{1-\varepsilon})$, where $0<\varepsilon\le 1$ is a fixed constant and $|V|$ is the number of vertices. As a consequence, we show that the labeled analogue of $r$CUMAPF is also NP-hard under the same condition.

cs.MA↗

Addressing Exogenous Variability in Cooperative Multi-Agent Reinforcement Learning

Cooperative multi-agent reinforcement learning (MARL) often fails under exogenous variability such as shifts in opponents or environment regimes that cannot be controlled by the team but alter the transition dynamics. We formalize this challenge as Exogenous Dec-POMDP (ED-POMDP), in which an episode-level exogenous regime, selected independently of the team, indexes the dynamics, and the global state is partitioned into components that are directly responsive to the current team action and components that are not directly action-responsive at the current step. This formulation exposes mediated influence: while team actions do not directly update the latter at the current step, they can shape their later evolution through induced changes in the former. Based on this, we propose LEICA, a CTDE-compatible algorithm that learns history-conditioned context representations for both components and shapes policy updates using agent-wise, influence-weighted counterfactual intrinsic rewards. Across SMAX benchmarks with opponent strategy shifts, LEICA consistently improves both training performance and generalization to unseen opponents' strategies over existing baselines, supporting the usefulness of influence-weighted shaping under exogenous train-test regime shifts.

cs.MA↗