Adapting to game trees in zero-sum imperfect information games

Adapting to game trees in zero-sum imperfect information games

23 December 2022

Pierre Ménard

Vianney Perchet

Papers citing "Adapting to game trees in zero-sum imperfect information games"

8 / 8 papers shown

Title
Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries Arnab Maiti Zhiyuan Fan Kevin G. Jamieson Lillian J. Ratliff Gabriele Farina 36 0 0 01 Apr 2025
A Policy-Gradient Approach to Solving Imperfect-Information Games with Iterate Convergence Mingyang Liu Gabriele Farina Asuman Ozdaglar 26 2 0 01 Aug 2024
Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning Yuheng Zhang Dian Yu Baolin Peng Linfeng Song Ye Tian Mingyue Huo Nan Jiang Haitao Mi Dong Yu 35 15 0 30 Jun 2024
Local and adaptive mirror descents in extensive-form games Côme Fiegel Pierre Ménard Tadashi Kozuno Rémi Munos Vianney Perchet Michal Valko 19 2 0 01 Sep 2023
Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation Yuanhao Wang Qinghua Liu Yunru Bai Chi Jin 27 28 0 13 Feb 2023
Independent Policy Gradient Methods for Competitive Reinforcement Learning C. Daskalakis Dylan J. Foster Noah Golowich 62 159 0 11 Jan 2021
Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent Gabriele Farina Christian Kroer T. Sandholm 46 72 0 28 Jul 2020
A Unified View of Large-scale Zero-sum Equilibrium Computation Kevin Waugh J. Andrew Bagnell 48 25 0 18 Nov 2014