Two Player
Two-player game theory investigates strategic interactions between two agents, aiming to understand optimal decision-making and equilibrium outcomes. Current research focuses on developing algorithms for finding Nash equilibria in various game settings, including zero-sum and general-sum games, often employing techniques like reinforcement learning, mirror descent, and Thompson sampling, and adapting these to handle imperfect information and large state spaces. This field is crucial for advancing artificial intelligence, particularly in areas like large language model alignment, multi-agent systems, and the development of robust and secure AI agents.
Papers
Pessimistic Minimax Value Iteration: Provably Efficient Equilibrium Learning from Offline Datasets
Han Zhong, Wei Xiong, Jiyuan Tan, Liwei Wang, Tong Zhang, Zhaoran Wang, Zhuoran Yang
An algorithmic solution to the Blotto game using multi-marginal couplings
Vianney Perchet, Philippe Rigollet, Thibaut Le Gouic