Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games

02/13/2021
by   Dustin Morrill, et al.
4

Hindsight rationality is an approach to playing multi-agent, general-sum games that prescribes no-regret learning dynamics and describes jointly rational behavior with mediated equilibria. We explore the space of deviation types in extensive-form games (EFGs) and discover powerful types that are efficient to compute in games with moderate lengths. Specifically, we identify four new types of deviations that subsume previously studied types within a broader class we call partial sequence deviations. Integrating the idea of time selection regret minimization into counterfactual regret minimization (CFR), we introduce the extensive-form regret minimization (EFR) algorithm that is hindsight rational for a general and natural class of deviations in EFGs. We provide instantiations and regret bounds for EFR that correspond to each partial sequence deviation type. In addition, we present a thorough empirical analysis of EFR's performance with different deviation types in common benchmark games. As theory suggests, instantiating EFR with stronger deviations leads to behavior that tends to outperform that of weaker deviations.

READ FULL TEXT

page 28

page 29

research
05/24/2022

Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games: Corrections

Hindsight rationality is an approach to playing general-sum games that p...
research
12/10/2020

Hindsight and Sequential Rationality of Correlated Play

Driven by recent successes in two-player, zero-sum game solving and play...
research
02/19/2020

Stochastic Regret Minimization in Extensive-Form Games

Monte-Carlo counterfactual regret minimization (MCCFR) is the state-of-t...
research
09/30/2020

Complexity and Algorithms for Exploiting Quantal Opponents in Large Two-Player Games

Solution concepts of traditional game theory assume entirely rational pl...
research
07/28/2022

Regret Minimization and Convergence to Equilibria in General-sum Markov Games

An abundance of recent impossibility results establish that regret minim...
research
10/28/2019

Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium

Self-play methods based on regret minimization have become the state of ...
research
08/11/2021

The Lawson-Hanson Algorithm with Deviation Maximization: Finite Convergence and Sparse Recovery

In this work we apply the "deviation maximization", a new column selecti...

Please sign up or login with your details

Forgot password? Click here to reset