Extends Optimal Transport to multiple agents, aiming for equitable and optimal distribution.
problem Sharing costs or goods equitably among multiple agents with different preferences.
method Minimizes the maximum transportation cost or maximizes the minimum utility.
result Provides a new algorithm faster than standard linear programming.
Deep learning has enabled traditional reinforcement learning methods to deal with high-dimensional problems. However, one of the disadvantages of deep reinforcement learning methods is the limited exploration capacity of learning agents. In this paper, we introduce an approach that integrates human strategies to increa…
Study on multi-agent decision making complexity, showing sample efficiency gaps.
problem Understanding sample efficiency in multi-agent decision making.
method General framework for interactive decision making, focusing on equilibrium computation.
result No 'reasonable' complexity measure can close gaps between single and multiple agents.
We propose a method to efficiently learn diverse strategies in reinforcement learning for query reformulation in the tasks of document retrieval and question answering. In the proposed framework an agent consists of multiple specialized sub-agents and a meta-agent that learns to aggregate the answers from sub-agents to…
Deep neural net solves multi-agent optimal trading problem.
problem Optimal trade execution for multiple agents and assets.
method Residual U-net with self-attention for viscosity solution approximation.
result Neural network approach outperforms finite difference methods.
Simplified feature selection using a single agent with restructured choice strategy.
problem Efficiency and cost issues in multi-agent reinforced feature selection.
method Single-agent approach with restructured choice strategy, including scanning method, feature prioritization, state representation, and reward scheme.
result Improved efficiency and effectiveness of feature selection.
Imitation learning algorithms can be used to learn a policy from expert demonstrations without access to a reward signal. However, most existing approaches are not applicable in multi-agent settings due to the existence of multiple (Nash) equilibria and non-stationary environments. We propose a new framework for multi-…
Predicts multiple vehicle trajectories efficiently.
problem Predicting uncertain future motions of agents in dynamic scenes.
method Probabilistic framework learning latent variables for multi-step future modeling.
result State-of-the-art predictions on vehicle trajectory datasets.
Agents learn and control complex mechanical systems through shared memories.
problem Controlling multi-joint dynamical systems.
method Coupled autoregressive active inference agents using Bayesian filtering and minimizing expected free energy.
result Demonstrated learning and control of a double mass-spring-damper system.
Stable cooperation emerges in fluctuating environments.
problem Evolutionary stability of cooperation in fluctuating conditions.
method Agents with fluctuating wealth share public goods, leading to cooperation.
result Agents with cooperation produce an advantage in fluctuating environments.
This paper uses probability tensors for efficient path planning in complex scenarios.
problem Efficient path planning in complex environments with obstacles and multiple goals.
method Probability tensors are used to model agent motion and decision-making, incorporating past and future information.
result The model finds solutions in complex scenarios, demonstrating realistic emergent behaviors.
Study multiple-population games using McKean-Vlasov equations.
problem Mean field games and control problems with multiple populations.
method Coupled forward-backward SDEs and Pontryagin's principle.
result Existence of mean field equilibria under various cooperation scenarios.
The paper aims to develop a methodology to test memory systems in reinforcement learning agents.
problem Understanding and evaluating memory systems in reinforcement learning agents and their generalization.
method Construct diverse memory tasks, develop an agent architecture combining multiple memory systems, and perform ablations.
result The agent architecture can apply learned knowledge to holdout data that differs from the training data.
A dynamic agent model is introduced with an annual random wealth multiplicative process followed by taxes paid according to a linear wealth-dependent tax rate. If poor agents pay higher tax rates than rich agents, eventually all wealth becomes concentrated in the hands of a single agent. By contrast, if poor agents are…
Reduces necessary conditions for collision avoidance on curved spaces.
problem Finding non-intersecting trajectories for multiple agents on curved spaces.
method Reduction by Lie group symmetries of variational collision avoidance problems.
result Derives necessary conditions for reduced extremals.
We develop model free PAC performance guarantees for multiple concurrent MDPs, extending recent works where a single learner interacts with multiple non-interacting agents in a noise free environment. Our framework allows noisy and resource limited communication between agents, and develops novel PAC guarantees in this…
Adaptive policies for multi-agent RL improve adaptiveness in changing environments.
problem Non-stationarity in multi-agent reinforcement learning where other agents may alter their policies.
method Train multiple adaptive policies for each agent and a policy predictor to select the best policy at execution time.
result Agents trained with our method outperform state-of-the-art methods in all tested environments.
Pareto optimal centralized risk sharing with multiple agents
problem Centralized risk sharing with endogenous prices
method Inclusive and fair Pareto optimality
result Equivalence between inclusive and fair Pareto optimality and balanced sequential optimization
Proposes a model for multi-agent reinforcement learning with hierarchical graph attention network.
problem Limited transferability of trained policies to new multi-agent tasks.
method Uses hierarchical graph attention network for representation learning and multi-agent actor-critic for policy learning.
result Demonstrates superior performance in mixed cooperative and competitive tasks compared to existing methods.
Study uses AUVs and RL to map river plumes over multiple days.
problem Long-term mapping of dynamic river plumes with multiple AUVs.
method Multi-agent reinforcement learning with spatiotemporal GPR.
result Multi-agent approach outperforms single-agent and benchmarks.
This work tackles uncertainty in multi-agent multi-modal trajectory forecasting.
problem Measuring and ranking uncertainty in multi-agent multi-modal trajectory forecasting.
method Proposes collaborative uncertainty (CU) and a CU-aware regression framework.
result The CU-aware regression framework improves SOTA systems' performances.
Many learning agents impact a financial market model, showing complex dynamics.
problem Understanding the dynamics of financial markets with multiple learning agents.
method Agent-based model of financial market with multiple reinforcement learning agents interacting.
result Inclusion of learning agents changes market dynamics to match empirical data.
This review explores how multiple agents learn to communicate in complex environments.
problem Learning effective communication strategies among multiple agents in partially observable environments.
method Review of recent algorithms and models for improving communication between agents, including Deep Recurrent Q-Networks.
result Introduction of a novel entropy-based evaluation metric for communication strategies.
Agentic LLMs improve trading by estimating market risk.
problem Lack of principled model-building step in agentic frameworks for finance.
method Developed an agentic system using LLMs to discover stochastic differential equations for financial time series.
result Model-informed trading strategies outperform standard LLM-based agents, improving Sharpe ratios.
Solves optimal control for trading multiple mean-reverting assets.
problem How to construct a portfolio from mean-reverting assets.
method Optimal control problem for power utility agent.
result Nearly explicit solution with properties of optimal solution.
COBRA addresses strategic behavior in online platforms by ensuring truthful reporting without monetary incentives.
problem Ensuring truthful reporting from strategic agents in online platforms.
method Proposes COBRA, an algorithm for contextual bandits involving strategic agents that disincentivizes strategic behavior.
result COBRA achieves sub-linear regret guarantee and incentive compatibility without monetary incentives.
Revealed preference theory studies the possibility of modeling an agent's revealed preferences and the construction of a consistent utility function. However, modeling agent's choices over preference orderings is not always practical and demands strong assumptions on human rationality and data-acquisition abilities. Th…
Developed scalable ABM for complex financial markets.
problem Simulating large-scale agent-based financial markets.
method Agent-based modeling, distributed computing, continuous double auction.
result Captures statistical properties of real financial markets.
In important applications involving multi-task networks with multiple objectives, agents in the network need to decide between these multiple objectives and reach an agreement about which single objective to follow for the network. In this work we propose a distributed decision-making algorithm. The agents are assumed …
Some agent-based models for growth and allocation of resources are described. The first class considered consists of conservative models, where the number of agents and the size of resources are constant during time evolution. The second class is made up of multiplicative noise models and some of their extensions to co…
We study two kinds of economic exchange, additive and multiplicative, in a system of N agents. The work is divided in two parts, in the first one, the agents are free to interact with each other. The system evolves to a Boltzmann-Gibbs distribution with additive exchange and condenses with a multiplicative one. If bank…
BGANs enable multi-agent learning with distributed private datasets.
problem Learning from distributed private datasets in multi-agent scenarios.
method Brainstorming GAN architecture for fully distributed learning.
result BGANs generate high-quality data samples with lower JSD and FID.
Recent progress in artificial intelligence through reinforcement learning (RL) has shown great success on increasingly complex single-agent environments and two-player turn-based games. However, the real-world contains multiple agents, each learning and acting independently to cooperate and compete with other agents, a…
New algorithms allow multiple robots to search efficiently without central coordination.
problem Efficiently locating targets in an unknown environment with multiple robots.
method SPATS and LATSI algorithms for asynchronous multi-agent active search.
result Multiple robots can independently make data-collection decisions without a central coordinator.
Study examines CSO algorithm for 3D swarming and tracking multiple targets.
problem Simulating and tracking multiple targets in 3D space.
method Cyclic Stochastic Optimization (CSO) algorithm implemented by mobile sensing agents.
result CSO algorithm converges in 3D space, minimizing uncertainty in targets' state estimates.
A new federated bandit problem with multiple adversaries, solved with a near-optimal algorithm.
problem Non-stochastic federated multi-armed bandit problem with multiple adversaries.
method Proposed a near-optimal federated bandit algorithm called FEDEXP3.
result Guaranteed sub-linear regret without exchanging sequences of selected arm identities or loss sequences among agents.
This paper considers a distributed reinforcement learning problem in which a network of multiple agents aim to cooperatively maximize the globally averaged return through communication with only local neighbors. A randomized communication-efficient multi-agent actor-critic algorithm is proposed for possibly unidirectio…
In this paper, we explore using deep reinforcement learning for problems with multiple agents. Most existing methods for deep multi-agent reinforcement learning consider only a small number of agents. When the number of agents increases, the dimensionality of the input and control spaces increase as well, and these met…
This paper proposes a definition of system health in the context of multiple agents optimizing a joint reward function. We use this definition as a credit assignment term in a policy gradient algorithm to distinguish the contributions of individual agents to the global reward. The health-informed credit assignment is t…
Develops a learning model predictive controller for competitive racing.
problem Lack of exploration in state space and complexity in obstacle avoidance.
method Explores state space through multiple initializations and develops a new method for convex terminal set selection.
result Yields a richer terminal safe set and maintains convexity.
New method defends RL agents from poisoning attacks without MDP knowledge.
problem Poisoning attacks on RL systems can cause learning failures.
method Generic poisoning framework for online RL, Vulnerability-Aware Adversarial Critic Poison (VA2C-P).
result Successfully prevents RL agents from learning good policies or converging to target policies.
Deep RL for multi-agent autonomous driving in dynamic environments.
problem Adapting to dynamic, multi-agent driving environments.
method Formulated Partially Observable Markov Games (POSG) for multi-agent learning.
result Demonstrated successful training of multi-agent control policies.
Recent developments in deep reinforcement learning are concerned with creating decision-making agents which can perform well in various complex domains. A particular approach which has received increasing attention is multi-agent reinforcement learning, in which multiple agents learn concurrently to coordinate their ac…
Study uses AI agents to improve equity portfolio management.
problem Improving stock selection and portfolio management efficiency.
method Role-based multi-agent systems for equity research.
result Multi-agent approach outperforms benchmarks in stock selection.
Proposes using logical specifications for multi-objective reinforcement learning to improve agent behavior.
problem Difficulties in controlling reinforcement learning agents and the need for better generalization.
method Uses propositional logic to specify the importance of multiple objectives, encoding these specifications using a recurrent neural network.
result MORL agents parameterized by logical specifications can generalize to novel combinations of objectives and achieve comparable performance.
Reproducibility in reinforcement learning is challenging: uncontrolled stochasticity from many sources, such as the learning algorithm, the learned policy, and the environment itself have led researchers to report the performance of learned agents using aggregate metrics of performance over multiple random seeds for a …
AI agents improve forecast combination but require transparency.
problem AI coding agents increase flexibility in empirical economics, leading to hidden degrees of freedom.
method Adapted open-source agent-loop architecture to empirical economics workflow, adding post-search holdout evaluation.
result Multiple agent runs outperform standard benchmarks in rolling evaluation but not all on post-search holdout.
In this work we study the optimal execution problem with multiplicative price impact in algorithm trading, when an agent holds an initial position of shares of a financial asset. The inter-selling-decision times are modelled by the arrival times of a Poisson process. The criterion to be optimised consists in maximising…