Fokker-Planck model shows debts are absorbed over time in wealth distribution.
problem Modeling wealth distribution with agents having debts.
method Fokker-Planck equation with variable diffusion coefficient.
result Debts are absorbed over time, leading to a positive wealth distribution.
FEN model learns fairness and efficiency in multi-agent systems.
problem Fairness in multi-agent systems for stability and productivity.
method Hierarchical reinforcement learning model with fair-efficient reward and sub-policies.
result FEN model easily learns both fairness and efficiency in multi-agent scenarios.
TradingAgents uses LLM-powered multi-agent framework for financial trading.
problem Lack of collaborative dynamics in multi-agent financial trading systems.
method Inspired by real-world trading firms, TradingAgents features specialized LLM-powered agents and a risk management team.
result Framework outperforms baseline models in trading performance metrics.
EOI enhances individuality in multi-agent systems.
problem Improving multi-agent cooperation through individuality.
method A probabilistic classifier that predicts agent identity based on observations, with intrinsic rewards and regularizers.
result EOI significantly outperforms existing methods in multi-agent cooperative scenarios.
Examines multiagent systems for complex learning tasks.
problem Achieving cohesive learning behavior in multiagent networks.
method General formulation for multiagent dynamics and conditions for learning.
result Conditions for achieving cohesive learning behavior in multiagent networks.
A new method simulates large, diverse populations of learning agents evolving in games.
problem Limited scalability and efficiency of Multi-Agent Reinforcement Learning.
method Parallelizable implementation of Policy Gradient and Opponent-Learning Awareness for evolutionary simulations.
result Simulated large, diverse populations of learning agents evolve under various strategies.
Herein, we applied statistical physics to study incomes of three (low-, medium- and high-income) society classes instead of the two (low- and medium-income)classes studied so far. In the frame of the threshold nonlinear Langevin dynamics and its threshold Fokker-Planck counterpart, we derived a unified formula for desc…
This paper simulates society's evolution using agent-based models and alternate maximization steps.
problem Understanding the complex evolution of human society.
method Agent-based simulation with a high population, joint alternate maximization algorithm.
result The proposed model shows societies develop in a realistic manner.
We found a unified formula for description of the household incomes of all society classes, for instance, of those of the European Union in year 2007. This formula is a stationary solution of the threshold Fokker-Planck equation (derived from the threshold nonlinear Langevin one). The formula is more general than the w…
We found a unified formula for description of the household incomes of all society classes, for instance, for the European Union in years 2005-2010. The formula is more general than well known that of Yakovenko et al. because, it satisfactorily describes not only the household incomes of low- and medium-income society …
Paper develops a new multi-agent reinforcement learning algorithm.
problem Improving policies in a network of communicating agents.
method Develops a multi-agent off-policy actor-critic algorithm using emphatic temporal difference learning.
result Proves convergence of the algorithm under linear function approximation.
A new multi-agent learning method improves performance in complex games.
problem Performance gap between MAPG and value-based multi-agent approaches.
method Introduces value function decomposition into multi-agent actor-critic framework for off-policy learning.
result DOP significantly outperforms state-of-the-art multi-agent reinforcement learning algorithms.
PPO algorithm converges to global optimality in multi-agent reinforcement learning.
problem Designing statistical guarantees for policy optimization methods in multi-agent reinforcement learning.
method Leveraging a multi-agent performance difference lemma, a localized action value function is used as a descent direction for each local policy, leading to a multi-agent PPO algorithm.
result The multi-agent PPO algorithm converges to the globally optimal policy at a sublinear rate under standard regularity conditions.
By using methods of statistical physics, we focus on the quantitative analysis of the economic income data descending from different databases. To explain our approach, we introduce the necessary theoretical background, the extended Yakovenko et al. (EY) model. This model gives an analytical description of the annual h…
The paper formalizes and analyzes multi-agent Q-learning with value factorization.
problem Understanding and improving the convergence of multi-agent Q-learning with value factorization.
method Formalized a multi-agent fitted Q-iteration framework for analyzing factorized multi-agent Q-learning.
result Multi-agent Q-learning with linear value factorization can converge under certain conditions.
New framework for multi-agent imitation learning in complex environments.
problem Multi-agent settings with multiple Nash equilibria and non-stationary environments.
method Generalized inverse reinforcement learning and actor-critic algorithm.
result Practical multi-agent imitation learning with good empirical performance.
New algorithm for multi-agent reinforcement learning with attention mechanism.
problem Challenges in training decentralized policies in multi-agent settings.
method Actor-attention-critic algorithm with centrally computed critics and attention mechanism.
result More effective and scalable learning in complex multi-agent environments.
New algorithm for multi-agent reinforcement learning scales with number of agents.
problem Existing methods for deep multi-agent reinforcement learning struggle with increasing number of agents.
method Proposes a distributed optimization approach assuming policies of agents are close in parameter space.
result Demonstrates superior performance on co-operative and competitive tasks compared to existing methods.
MagNet uses neural networks to predict multi-agent dynamics from observations.
problem Predicting the evolution of complex multi-agent systems.
method Formulated a coupled non-linear network with ODE-based state evolution, trained a neural network to discover dynamics from observations.
result Orders of magnitude improvement in prediction accuracy over traditional models.
CM3 learns multi-agent cooperation by first achieving individual goals.
problem Cooperative multi-agent control with multiple goals and interactions.
method Two-stage curriculum: first learn individual goals, then cooperation; new policy gradient with credit function.
result CM3 learns faster on multi-goal multi-agent problems than existing algorithms.
Modern excavations yielded a distribution of the house areas in the ancient Egyptian city Akhetaten, which was populated for a short period during the 14th century BC. Assuming that the house area is a measure of the wealth of its inhabitants allows us to make a comparison of the wealth distributions in ancient and mod…
FACMAC combines deep policy gradients with factored critic for multi-agent reinforcement learning.
problem Cooperative multi-agent reinforcement learning in discrete and continuous action spaces.
method FACMAC uses a centralised but factored critic, combining per-agent utilities into a joint action-value function.
result FACMAC outperforms MADDPG and other baselines on multi-agent particle environments and StarCraft II tasks.
Paper presents a method to efficiently learn ordered representations of multi-agent data.
problem Challenges in learning consistent representations of multi-agent interactions.
method Dynamic alignment method to order multi-agent data for faster representation learning.
result Representation learning of multi-agent data is significantly accelerated.
Reduces overestimation bias in multi-agent RL, improving performance.
problem Value function overestimation bias in multi-agent RL.
method Double centralized critics to reduce overestimation bias.
result Significant improvement in performance on mixed tasks.
This work benchmarks MARL algorithms in cooperative tasks.
problem Lack of evaluation tasks and criteria for comparing MARL algorithms.
method Systematic evaluation of three MARL algorithm classes in diverse cooperative tasks.
result Insights into the effectiveness of different learning approaches.
NeuroMAS treats multi-agent systems as neural networks for scalable, trainable coordination.
problem Designing multi-agent systems as hand-designed workflows is inefficient and inflexible.
method NeuroMAS treats multi-agent systems as a neural network architecture with reinforcement learning for scalable coordination.
result NeuroMAS improves significantly over multi-agent baselines and can be scaled progressively.
New algorithms tackle multi-agent problems with hybrid action spaces.
problem Applying deep reinforcement learning to multi-agent problems with discrete-continuous hybrid action spaces.
method Proposed two novel algorithms: Deep MAPQN and Deep MAHHQN, using centralized training and decentralized execution.
result Empirical results show both algorithms significantly outperform existing methods.
Study compares MAPF and MARL algorithms for warehouse automation.
problem Optimizing multi-agent pickup and delivery in warehouse settings.
method Compared conflict-based search (MAPF) and shared experience actor-critic (MARL).
result Comprehensive benchmarking of MAPF and MARL in a simulated warehouse environment.
This paper surveys methods to handle non-stationarity in multi-agent deep reinforcement learning.
problem Non-stationarity in multi-agent reinforcement learning environments.
method Modifications in training procedures, opponent policy representation learning, meta-learning, communication, and decentralized learning.
result A comprehensive review of recent works on addressing non-stationarity in multi-agent deep reinforcement learning.
MARL algorithm uses regularization to avoid explicit structures, improving performance.
problem Lack of effective reinforcement learning methods for multi-agent systems.
method MARQ uses regularization to promote structured exploration without explicit centralized structures.
result MARQ outperforms existing methods in multi-agent environments.
RFM models predict multi-agent behavior, offering insights and faster learning.
problem Understanding and improving multi-agent systems learning.
method Relational Forward Models (RFM) that learn to predict future agent behavior.
result RFM modules inside agents lead to faster learning compared to baseline methods.
This paper reviews deep RL methods for multi-agent systems.
problem Challenges in high-dimensional environments for RL algorithms.
method Survey of different MADRL approaches, including non-stationarity, partial observability, etc.
result Insights into robust multi-agent learning methods.
Improved exploration in cooperative multi-agent reinforcement learning.
problem Limited expressiveness of Gaussian policies in DecSPG hinders effective exploration.
method Proposes decentralized diffusion policy learning (DDPL) with denoising diffusion probabilistic models.
result Consistently improved performance on various MARL benchmarks.
Paper tackles delays in multi-agent reinforcement learning, improving performance.
problem Challenges in reinforcement learning due to delays in real-world systems.
method Proposes a novel framework for multi-agent reinforcement learning with delays, using Delay-Aware Markov Games and centralized-decentralized training.
result Demonstrates significant improvement in performance with delay-aware multi-agent reinforcement learning.
New method combines value function decomposition and policy gradients for cooperative multi-agent reinforcement learning.
problem Challenges in cooperative multi-agent reinforcement learning, especially credit assignment and large action spaces.
method Decomposed Soft Actor-Critic (mSAC) method with Q network architecture, discrete probabilistic policy, and counterfactual advantage function.
result Significantly outperforms policy-based approach COMA and achieves competitive results with SOTA value-based approach Qmix.
Agents learn to cooperate by exchanging messages in a shared graph model.
problem Creating effective multi-agent cooperation in unknown environments.
method Shared agent-entity graph, multi-agent reinforcement learning, invariant to team size and permutation.
result Decentralized multi-agent systems can quickly transfer learned policies to different team sizes.
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.
A new framework for multi-agent inverse reinforcement learning.
problem Finding suitable reward functions for multi-agent scenarios.
method MA-AIRL, based on a new solution concept and maximum pseudolikelihood estimation.
result MA-AIRL can recover highly correlated reward functions and significantly outperforms prior methods.
We study the effect of the social stratification on the wealth distribution on a system of interacting economic agents that are constrained to interact only within their own economic class. The economical mobility of the agents is related to its success in exchange transactions. Different wealth distributions are obtai…
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.
The inequality of wealth distribution is a universal phenomenon in the civilized nations, and it is often imputed to the Matthew effect, that is, the rich get richer and the poor get poorer. Some philosophers unjustified this phenomenon and tried to put the human civilization upon the evenness of wealth. Noticing the f…
Improves neural relational inference for dynamic multi-agent trajectories.
problem Limited accuracy of NRI in short output sequences for relational inference in multi-agent trajectories.
method Proposes DYnamic multi-AgentRelational Inference (DYARI) model to handle changing interactions over time.
result DYARI model outperforms NRI in dynamic relational inference tasks.
CODA resolves coordination issues in offline multi-agent reinforcement learning.
problem Coordination failure in offline multi-agent reinforcement learning.
method Diffusion-based multi-agent trajectory generator for data augmentation.
result CODA resolves coordination pathologies in continuous polynomial games and complex benchmarks.
These are the written discussions of the paper "Bayesian measures of model complexity and fit" by D. Spiegelhalter et al. (2002), following the discussions given at the Annual Meeting of the Royal Statistical Society in Newcastle-upon-Tyne on September 3rd, 2013.
The paper introduces a health-informed policy gradient method for multi-agent reinforcement learning.
problem Optimizing joint reward functions in multi-agent systems with varying agent health.
method Health-informed credit assignment in a multi-agent proximal policy optimization algorithm.
result Significant improvement in learning performance compared to traditional methods.
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.
SMAC benchmarks StarCraft II multi-agent micromanagement challenges.
problem Benchmarking cooperative multi-agent reinforcement learning.
method Proposes StarCraft Multi-Agent Challenge (SMAC) for evaluation.
result SMAC provides a standard benchmark for multi-agent RL.
New algorithm for multi-agent reinforcement learning with reduced communication.
problem Cooperative learning among multiple agents with limited communication.
method Randomized multi-agent actor-critic algorithm for directed graphs.
result Algorithm solves problem for strongly connected graphs with reduced communication.