The paper introduces Meta-Gradient Informed Multi-Objective Multi-Agent Reinforcement Learning (MIRL), a framework that leverages the structure of multiple objectives to enhance cooperation among agents. By formulating MOMARL at both team and individual levels and using objective-wise counterfactual credit assignment, MIRL allows agents to learn how to prioritize objectives individually while jointly optimizing a system-level objective. Experiments on a multi-objective particle environment demonstrate that MIRL, especially its dynamic variant, improves Pareto-front quality compared to baseline methods.
arXiv:2607. 29559v1 Announce Type: new Abstract: Reinforcement Learning (RL) systems are typically trained using a single, well-specified scalar reward function.
arXiv:2606. 14693v1 Announce Type: cross Abstract: Cooperative multi-objective multi-agent reinforcement learning (MOMARL) models team decision making under multiple, potentially conflicting objectives.
arXiv:2602. 07764v2 Announce Type: replace-cross Abstract: Multi-objective reinforcement learning (MORL) seeks to train agents capable of balancing conflicting objectives.
arXiv:2511. 02304v2 Announce Type: replace-cross Abstract: We study learning multi-task, multi-agent policies for cooperative, temporal objectives, under centralized training, decentralized execution.
arXiv:2603. 21563v4 Announce Type: replace Abstract: Collaborative multi-agent large language models (LLMs) can solve complex reasoning tasks by decomposing roles, but reinforcement learning for such systems is limited by credit assignment: shared terminal rewards obscure individual contributions and can encourage free-riding.
arXiv:2608. 08604v1 Announce Type: new Abstract: Multi-agent reinforcement learning (MARL) is a powerful framework for solving complex collaborative tasks, but it relies heavily on well-defined global reward functions.
arXiv:2606. 02337v1 Announce Type: new Abstract: Constrained Multi-agent reinforcement learning (CMARL) faces two intertwined challenges: the joint action space grows exponentially with the number of agents, and additional requirements couple agents in ways that reward structure alone does not capture.
arXiv:2604. 13472v2 Announce Type: replace-cross Abstract: Cooperative multi-agent reinforcement learning (MARL) is widely used to address large joint observation and action spaces by decomposing a centralized control problem into multiple interacting agents.
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.
The paper introduces a new multi‑agent reinforcement learning framework that separates agent identity from behavior by using events to trigger behavioral changes. It proposes Neural Manifold Diversity (NMD) to create a continuous behavior manifold and an event‑based hypernetwork that generates Low‑Rank Adaptation (LoRA) modules for on‑the‑fly policy reconfiguration. The authors prove that this design preserves reward maximization and show empirically that it outperforms baselines, generalizes zero‑shot, and uniquely solves tasks requiring sequential behavior reassignment.
Collab‑Solver introduces a multi‑agent policy learning framework for mixed‑integer linear programming (MILP) that enables collaborative optimization of multiple solver modules. By modeling the interaction between cut selection and branching as a Stackelberg game, the approach employs a two‑phase learning paradigm—data‑communicated policy pretraining followed by coordinated policy refinement. Experiments on synthetic and large‑scale real‑world MILP datasets show that the jointly learned policies markedly improve solving performance and generalize well across diverse instance sets.
WCC is a learning‑based framework that decides dynamically when to apply Cooperative Coevolution (CC) versus Non‑Decomposition Algorithms (NDAs) in large‑scale global optimization. It models this decision as a Markov decision process, using a tailored feature set, reward scheme, and network architecture to enable fine‑grained, adaptive switching and conditional budget allocation without expert input. Experiments show WCC competes strongly and generalizes across problems, horizons, and baseline optimizers, supporting a low‑budget "train‑once and reuse" approach while providing new practical insights into CC deployment.