Training Generalizable Collaborative Agents via Strategic Risk Aversion

πŸ“… 2026-02-24
πŸ“ˆ Citations: 0
✨ Influential: 0
πŸ“„ PDF
πŸ€– AI Summary
Existing cooperative agents exhibit fragility when interacting with unfamiliar partners, primarily due to free-riding behaviors during training and a lack of strategic robustness. This work proposes incorporating strategic risk aversion as an inductive bias within a multi-agent reinforcement learning framework, guiding agents to proactively avoid inefficient equilibria in cooperative games. The approach not only effectively suppresses free-riding but also achieves collaborative outcomes that surpass Nash equilibria in efficiency. Evaluated across multiple standard cooperative benchmarks and large language model–based collaboration scenarios, the proposed agents consistently demonstrate stable cooperation with heterogeneous and previously unseen partners, significantly enhancing both generalization and robustness.

Technology Category

Application Category

πŸ“ Abstract
Many emerging agentic paradigms require agents to collaborate with one another (or people) to achieve shared goals. Unfortunately, existing approaches to learning policies for such collaborative problems produce brittle solutions that fail when paired with new partners. We attribute these failures to a combination of free-riding during training and a lack of strategic robustness. To address these problems, we study the concept of strategic risk aversion and interpret it as a principled inductive bias for generalizable cooperation with unseen partners. While strategically risk-averse players are robust to deviations in their partner's behavior by design, we show that, in collaborative games, they also (1) can have better equilibrium outcomes than those at classical game-theoretic concepts like Nash, and (2) exhibit less or no free-riding. Inspired by these insights, we develop a multi-agent reinforcement learning (MARL) algorithm that integrates strategic risk aversion into standard policy optimization methods. Our empirical results across collaborative benchmarks (including an LLM collaboration task) validate our theory and demonstrate that our approach consistently achieves reliable collaboration with heterogeneous and previously unseen partners across collaborative tasks.
Problem

Research questions and friction points this paper is trying to address.

collaborative agents
generalization
strategic robustness
free-riding
unseen partners
Innovation

Methods, ideas, or system contributions that make the work stand out.

strategic risk aversion
generalizable cooperation
multi-agent reinforcement learning
free-riding mitigation
collaborative agents
πŸ”Ž Similar Papers
No similar papers found.
C
Chengrui Qu
Department of Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA, USA
Yizhou Zhang
Yizhou Zhang
California Institute of Technology
Game TheoryReinforcement LearningMachine Learning
N
Nicholas Lanzetti
Department of Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA, USA
Eric Mazumdar
Eric Mazumdar
Assistant Professor, California Institute of Technology