Regret-minimization Algorithms For Multi-agent Cooperative Learning Systems

Abstract

A Multi-Agent Cooperative Learning (MACL) system is an artificial intelligence (AI) system where multiple learning agents work together to complete a common task. Recent empirical success of MACL systems in various domains (e.g. traffic control, cloud computing, robotics) has sparked active research into the design and analysis of MACL systems for sequential decision making problems. One important metric of the learning algorithm for decision making problems is its regret, i.e. the difference between the highest achievable reward and the actual reward that the algorithm gains. The design and development of a MACL system with low-regret learning algorithms can create huge economic values. In this thesis, I analyze MACL systems for different sequential decision making problems. Concretely, the Chapter 3 and 4 investigate the cooperative multi-agent multi-armed bandit problems, with full-information or bandit feedback, in which multiple learning agents can exchange their information throu

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyyi2023regret

Related papers

• Regret Bounds For Decentralized Learning In Cooperative Multi-agent Dynamical Systems (2020)0.00
• Inducing Cooperation Via Team Regret Minimization Based Multi-agent Deep Reinforcement Learning (2019)0.00
• Algorithms In Multi-agent Systems: A Holistic Perspective From Reinforcement Learning And Game Theory (2020)0.00
• Online Learning For Cooperative Multi-player Multi-armed Bandits (2021)5.24
• Regret Minimization And Convergence To Equilibria In General-sum Markov Games (2022)0.00
• Learning In Cooperative Multiagent Systems Using Cognitive And Machine Models (2023)7.81
• Emergent Cooperation Through Mutual Information Maximization (2020)0.00
• Distributed No-regret Learning In Multi-agent Systems (2020)0.00