arXiv Machine Learning By Chih-Wei Huang, Hsin-Chieh Lee, Yun-Chen Yu, Ibrahim Althamary, Rongxing Lu, Phone Lin

BE-CTDE: Blockchain-Enabled Multi-Agent Reinforcement Learning with Anomaly Detection and Token Economics

Read the original on arXiv Machine Learning →

BE-CTDE introduces a blockchain‑enabled framework for multi‑agent reinforcement learning that couples behavioral verification with a token‑based incentive system. The approach uses a verifier to compare executed trajectories against shared‑policy recommendations, and the resulting flags drive token mechanisms such as slashing, burning, rewards, and compensation. Experiments on multi‑agent path‑finding show that BE‑CTDE achieves higher success rates and lower collision rates than state‑of‑the‑art baselines, even when adversaries dominate the population.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Oct 7

Independent Multi-Agent Reinforcement Learning with Counterfactual Semantic-Social World Models

The paper introduces CASTLE, a framework for fully decentralized multi‑agent reinforcement learning that uses two offline‑trained world models to provide in‑context guidance to independent agents. A Local Dynamics World Model captures each agent’s trajectory dynamics, while a Semantic‑Social World Model predicts short‑horizon task and social outcomes for candidate actions based on counterfactual simulator rollouts. During online learning, these frozen models supply prediction logits to an independent PPO policy, enabling agents to compare potential actions prospectively rather than relying solely on scalar rewards. CASTLE outperforms existing baselines on several multi‑particle benchmark tasks, achieving the highest mean final scores across 30 seeds.

By Fernando Martinez, Tao Li, Yingdong Lu, Juntao Chen
arXiv AI
Oct 16

Learning Rewards in Strategic Games

The paper investigates how to infer agents’ underlying incentives in strategic multi‑agent settings, where traditional inverse reinforcement learning (IRL) may fail to produce rewards that guide optimal play. It introduces the concept of strategic identifiability and shows that learning from a fixed pair of policies can be insufficient regardless of sample size. To address this, the authors propose an active IRL algorithm for two‑player repeated Stackelberg games, combining maximum‑likelihood estimation with experimental design to achieve finite‑sample guarantees on sub‑optimality, and validate the approach in an anti‑poaching scenario.

By Antoine Bergerault, Cyrille Kone, Giorgia Ramponi
Hugging Face Trending Papers
Jul 30

ZAPs: A Reward Attribution Framework for DeFi Ecosystems with Adversarial-Robust Scoring via Parallel Anomaly Ensemble Detection

Incentive programs are central to user acquisition in decentralized finance, but many reward systems rely on raw volume, transaction count, and wallet count, making them vulnerable to bots and sybil operations. We present ZAPs, a reward attribution framework that combines economic contribution scoring with adversarial robustness.

arXiv Machine Learning
Sep 24

Optimization without Future Compromises? Decentralized Coordination via Collective and Reinforcement Learning

The paper introduces Hierarchical Reinforcement and Collective Learning (HRCL), a framework that combines multi‑agent reinforcement learning (MARL) with decentralized coordination. HRCL uses MARL at a high level to generate strategic guidance that limits the decision space for low‑level agents, enabling efficient short‑term coordination while considering long‑term effects. Experiments on synthetic, energy‑management, and drone‑swarm scenarios demonstrate faster convergence and significant reductions in system‑wide and individual costs compared to standalone MARL.

By Chuhao Qin, Evangelos Pournaras