Moonbase
← Back to Awards
SMALL PROJECTNSF · NSFNSF

AF: Small: Towards Theoretical Foundations of Multi-agent Learning - Algorithms, Dynamics and their Limitations

Ioannis Panageas·University of California-Irvine, CA·2025–2028·ACTIVE
Donate

INSTITUTION

University of California-Irvine, CA

PRINCIPAL INVESTIGATOR

Ioannis Panageas

FUNDING

$399K

YEAR

2025

MOONBASE SCORE

Still being scored

LOADING MOONBASE SCORE

Abstract

This research project explores fundamental principles underlying how groups of intelligent decision-makers—called "agents"—interact and learn within shared environments. Understanding these interactions is increasingly important because they directly impact critical areas such as autonomous driving, economics, evolutionary biology, robotics, artificial intelligence safety, and strategic decision-making. By developing theoretical insights and efficient learning algorithms, the project aims to determine when and how these complex multi-agent systems can reach equilibrium, resulting in predictable and stable outcomes. Beyond scientific advancement, the project will actively integrate its research findings into undergraduate and graduate curricula. Additionally, through the organization of workshops, the project will provide students hands-on opportunities to engage with current research, thus preparing students to effectively tackle emerging challenges at the intersection of multi-agent systems and game theory. This research project aims to develop a robust theoretical framework for analyzing learning processes in multi-agent systems—environments in which independent agents interact repeatedly to achieve their objectives. The project's primary goals include designing computationally efficient algorithms that provably converge to equilibrium states, particularly in scenarios characterized by both cooperative and competitive interactions and in games where agents have large action spaces. Additionally, the project seeks to address long-standing open problems concerning classical learning methods, specifically the rate of convergence for well-known learning algorithms, such as fictitious play. Methodologically, the research will leverage approaches from algorithmic game theory, optimization theory, and dynamical systems analysis. The outcomes of this work are expected to significantly advance the understanding of multi-agent learning dynamics, offer new algorithmic solutions for structured games, and impact applications in artificial intelligence and online decision-making. This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

SMALL PROJECTDirectorate for Computer and Information Science and EngineeringAlgorithmic FoundationsALGORITHMSCOMPUT GAME THEORY & ECONthroughunderstandingincludeefficientprinciplesintelligenceintegratescenariospreparingorganizationworthyreflectsconvergenceimportantdeterminecomplexresultingroboticsonlineunderlying

Are you the primary organization running this research?

The two tools below are built for the principal investigator & host institution behind this project.