6 papers
A* Search Without Expansions: Learning Heuristic Functions with Deep Q-Networks
Forest Agostinelli, Shahaf S. Shperberg, Alexander Shmakov +3
Efficiently solving problems with large action spaces using A* search remains a significant challenge. This is because, for each iteration of A* search, the number of nodes generat…
Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
Ioannis Anagnostides, Fivos Kalogiannis, Ioannis Panageas +2
Adversarial team games model multiplayer strategic interactions in which a team of identically-interested players is competing against an adversarial player in a zero-sum game. Suc…
Game-Theoretic Multiagent Reinforcement Learning
Yaodong Yang, Chengdong Ma, Zihan Ding +4
Tremendous advances have been made in multiagent reinforcement learning (MARL). MARL corresponds to the learning problem in a multiagent system in which multiple agents learn simul…
AI Alignment: A Comprehensive Survey
Jiaming Ji, Tianyi Qiu, Boyuan Chen +23
AI alignment aims to make AI systems behave in line with human intentions and values. As AI systems grow more capable, so do risks from misalignment. To provide a comprehensive and…
Ensemble Value Functions for Efficient Exploration in Multi-Agent Reinforcement Learning
Lukas Schäfer, Oliver Slumbers, Stephen McAleer +3
Multi-agent reinforcement learning (MARL) requires agents to explore within a vast joint action space to find joint actions that lead to coordination. Existing value-based MARL alg…
Sample-Efficient Regret-Minimizing Double Oracle in Extensive-Form Games
Xiaohang Tang, Chiyuan Wang, Chengdong Ma +3
Extensive-Form Game (EFG) represents a fundamental model for analyzing sequential interactions among multiple agents and the primary challenge to solve it lies in mitigating sample…