Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

255176101 · Jun 202019922001200920172026
48 results for multi-agent RL

Study differential privacy in multi-agent RL, achieving efficient and private learning.

problem Protecting sensitive data in multi-agent reinforcement learning.
method Extending DP definitions to two-player games, designing an efficient algorithm with privatized bonuses.
result Achieved trajectory-wise differential privacy in multi-agent RL, improving regret bounds.

MASA framework uses RL to balance portfolio returns and risks.

problem Managing portfolio risk in turbulent financial markets.
method Multi-agent reinforcement learning with a market observer.
result MASA framework outperforms RL approaches in balancing returns and risks.

AutoDIME automates design of multi-agent environments for RL.

problem Designing multi-agent environments for reinforcement learning is challenging.
method Developed intrinsic teacher rewards for multi-agent settings and evaluated them in various tasks.
result Value disagreement was found to be most consistent and effective across tasks.

In the last few years, deep multi-agent reinforcement learning (RL) has become a highly active area of research. A particularly challenging class of problems in this area is partially observable, cooperative, multi-agent learning, in which teams of agents must learn to coordinate their behaviour while conditioning only…

2019-02-11abs ↗pdf ↗

We propose a novel approach to address one aspect of the non-stationarity problem in multi-agent reinforcement learning (RL), where the other agents may alter their policies due to environment changes during execution. This violates the Markov assumption that governs most single-agent RL methods and is one of the key c…

2019-11-28abs ↗pdf ↗

The paper tackles cooperative RL with function approximation, achieving near-optimal learning with limited communication.

problem Cooperative multi-agent reinforcement learning with function approximation.
method Careful message-passing and cooperative value iteration.
result Achieving near-optimal no-regret learning with limited communication in cooperative multi-agent settings.

This paper combines RL with CPPI and TIPP for better trading strategies.

problem Challenges in quantitative trading due to swift dynamics and uncertainties.
method Fusion of CPPI and TIPP with MADDPG framework for multi-agent reinforcement learning.
result CPPI-MADDPG and TIPP-MADDPG outperform traditional strategies in real-market shares.

Agents learn to give rewards to others in a shared learning environment.

problem How to encourage cooperation among RL agents in a shared environment.
method Each agent learns a reward function to influence others, optimizing for its own and others' extrinsic objectives.
result Agents significantly outperform standard RL in Markov games, often finding near-optimal division of labor.

New algorithm tackles non-stationary RL with near-optimal regret bounds.

problem Model-free reinforcement learning in non-stationary Markov decision processes.
method Proposed RestartQ-UCB algorithm with Freedman-type bonus terms.
result Achieves near-optimal dynamic regret bound in non-stationary RL.

This work tackles robust RL in multi-agent settings, improving sample efficiency.

problem Overcoming environmental uncertainties in multi-agent reinforcement learning.
method Proposes DRNVI, a sample-efficient algorithm for learning robust equilibria in RMGs.
result Establishes near-optimal sample complexity for solving RMGs.

The paper simplifies multi-agent RL dynamics in finite-state Markov games using homogenization.

problem Approximating complex multi-agent reinforcement learning dynamics in finite-state Markov games.
method Rescaling learning process by reducing learning rate and increasing update frequency, proving convergence to an ODE.
result The rescaled process converges to an ODE that approximates the agent's learning dynamics.

The paper uncovers the mathematical structure enabling value decomposition in multi-agent systems.

problem Theoretical justification for why value decomposition works effectively in multi-agent systems remains underexplored.
method The paper introduces the concept of Markov entanglement to measure the underlying structure and demonstrates how it can be used to bound the decomposition error.
result The widely-used class of index policies is weakly entangled and enjoys a sublinear O(N)\mathcal O(\sqrt{N}) scale of decomposition error for NN-agent systems.

Study multi-agent RL in OTC markets, learning from agents' interactions.

problem Designing efficient RL solutions for OTC market interactions.
method Parameterized reward functions, shared policy learning, RL calibration.
result Agents learn to balance hedging and skewing in market simulations.

IG-RL learns adaptive traffic signals for any network, outperforming existing methods.

problem Adaptive traffic signal control for large networks with combinatorial state and action spaces.
method Graph-Convolutional Networks for decentralized, flexible control.
result IG-RL generalizes to new networks and traffic conditions without additional training.

VPP learns joint policies for multi-agent RL through interactions.

problem Learning effective joint policies for multi-agent reinforcement learning.
method VPP integrates variational inference into policy layers for efficient sampling and differentiability.
result VPP outperforms previous methods on large-scale multi-agent tasks.

Market makers play an important role in providing liquidity to markets by continuously quoting prices at which they are willing to buy and sell, and managing inventory risk. In this paper, we build a multi-agent simulation of a dealer market and demonstrate that it can be used to understand the behavior of a reinforcem…

2019-11-14abs ↗pdf ↗

This paper optimizes model-based RL for two-player zero-sum games with near-optimal sample complexity.

problem Optimizing model-based reinforcement learning for two-player zero-sum games with minimal samples.
method Model-based reinforcement learning approach for two-player discounted zero-sum Markov games with a generative model.
result Achieves a sample complexity of ildeO(SAB(1γ)3ε2) ilde O(|S||A||B|(1-γ)^{-3}ε^{-2}) for finding the Nash equilibrium and ε-NE policies.

We discuss deep reinforcement learning in an overview style. We draw a big picture, filled with details. We discuss six core elements, six important mechanisms, and twelve applications, focusing on contemporary work, and in historical contexts. We start with background of artificial intelligence, machine learning, deep…

2018-10-15abs ↗pdf ↗

OOM-RL uses financial market losses to align AI agents in autonomous systems.

problem Constrained alignment of autonomous software agents in live financial markets.
method Deploying agents in live financial markets to enforce strict test-driven workflows.
result Final OOM-RL-aligned system achieved a stable equilibrium with an annualized Sharpe ratio of 2.06.

Survey of RL methods for control systems with time delays.

problem Time delays in cyber-physical systems degrade RL performance and stability.
method Categorizes and analyzes five major families of RL methods for time delays.
result Identifies key trade-offs and practical guidelines for selecting RL methods.

MSPM uses modular agents to manage financial portfolios efficiently.

problem Scalability and reusability issues in RL-based financial portfolio management.
method Modular design with Evolving Agent Module (EAM) and Strategic Agent Module (SAM).
result MSPM improves profit accumulation by at least 186.5% compared to CRP.

Unfair stock trading strategies have been shown to be one of the most negative perceptions that customers can have concerning trading and may result in long-term losses for a company. Investment banks usually place trading orders for multiple clients with the same target assets but different order sizes and diverse req…

2019-12-14abs ↗pdf ↗

This research tackles information design in multi-agent reinforcement learning.

problem Designing information to influence other adaptive agents in a non-stationary environment.
method Formulated Markov signaling game, introduced signaling gradient and extended obedience constraints.
result Developed efficient algorithm for mixed-motive tasks in multi-agent reinforcement learning.

Framework for multi-agent RL with human feedback in a Snake game.

problem Improving multi-agent reinforcement learning with human feedback.
method Developed a simulated game environment for offline model training and online competitions. Introduced HILL methods and reward manipulation heuristics.
result Agents with HILL methods outperform those without in online competitions.

A deep RL framework optimizes resource allocation in wireless networks.

problem Optimizing resource allocation and interference in wireless networks.
method Multi-agent deep reinforcement learning for distributed decision-making.
result Our approach outperforms decentralized and centralized baselines in terms of user rates.

The recent success of single-agent reinforcement learning (RL) in Internet of things (IoT) systems motivates the study of multi-agent reinforcement learning (MARL), which is more challenging but more useful in large-scale IoT. In this paper, we consider a voting-based MARL problem, in which the agents vote to make grou…

2019-07-02abs ↗pdf ↗

New algorithm tackles multi-agent reinforcement learning with optimal convergence rate.

problem Multi-agent reinforcement learning with large state spaces and linear function approximations.
method Refined AVLPR framework with data-dependent pessimistic estimation and action-dependent bonuses.
result First algorithm with optimal O(T1/2)O(T^{-1/2}) convergence rate and no poly(AmaxA_{\max}) dependency.