General search techniques without common knowledge for imperfect-information games, and application to superhuman Fog of War chess

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Brian Hu, Sandholm, Tuomas
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Domain-Independent Game Abstraction using Word Embedding Techniques
by: Kim, Juho, et al.
Published: (2026)

Heuristic Pathologies and Further Variance Reduction via Uncertainty Propagation in the AIVAT Family of Techniques
by: Kim, Juho, et al.
Published: (2026)

Parallelizing Counterfactual Regret Minimization
by: Kim, Juho, et al.
Published: (2026)

Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation
by: Zhang, Brian, et al.
Published: (2022)

Exponential Lower Bounds on the Double Oracle Algorithm in Zero-Sum Games
by: Zhang, Brian Hu, et al.
Published: (2024)

On the Outcome Equivalence of Extensive-Form and Behavioral Correlated Equilibria
by: Zhang, Brian Hu, et al.
Published: (2024)

Efficient representations for team and imperfect-recall equilibrium computation
by: Carminati, Luca, et al.
Published: (2026)

Simultaneous incremental support adjustment and metagame solving: An equilibrium-finding framework for continuous-action games
by: Martin, Carlos, et al.
Published: (2024)

Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Extensive-Form Games
by: Zhang, Brian Hu, et al.
Published: (2023)

Study and improvement of search algorithms in two-players perfect information games
by: Cohen-Solal, Quentin
Published: (2025)

Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization
by: Zhang, Brian Hu, et al.
Published: (2022)

Watermarking Game-Playing Agents in Perfect-Information Extensive-Form Games
by: Kim, Juho, et al.
Published: (2026)

ApproxED: Approximate exploitability descent via learned best responses
by: Martin, Carlos, et al.
Published: (2023)

Convergence of $\text{log}(1/ε)$ for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis
by: Anagnostides, Ioannis, et al.
Published: (2024)

Efficient $Φ$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games
by: Zhang, Brian Hu, et al.
Published: (2024)

Learning a Game by Paying the Agents
by: Zhang, Brian Hu, et al.
Published: (2025)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
by: Zhang, Brian Hu, et al.
Published: (2025)

On the Interplay between Social Welfare and Tractability of Equilibria
by: Anagnostides, Ioannis, et al.
Published: (2023)

Solving Infinite-Player Games with Player-to-Strategy Networks
by: Martin, Carlos, et al.
Published: (2025)

Hidden-Role Games: Equilibrium Concepts and Computation
by: Carminati, Luca, et al.
Published: (2023)

A Lower Bound on Swap Regret in Extensive-Form Games
by: Daskalakis, Constantinos, et al.
Published: (2024)

Fog of War Chess
by: Gehnen, Matthias, et al.
Published: (2026)

Simplifying imperfect recall games
by: Gimbert, Hugo, et al.
Published: (2025)

Scalable Mechanism Design for Multi-Agent Path Finding
by: Friedrich, Paul, et al.
Published: (2024)

The Complexity of Proper Equilibrium in Extensive-Form and Polytope Games
by: Zhang, Brian Hu, et al.
Published: (2026)

Faster Game Solving via Hyperparameter Schedules
by: Zhang, Naifeng, et al.
Published: (2024)

Equilibrium Refinements Improve Subgame Solving in Imperfect-Information Games
by: Kubicek, Ondrej, et al.
Published: (2026)

Faster Optimal Coalition Structure Generation via Offline Coalition Selection and Graph-Based Search
by: Taguelmimt, Redha, et al.
Published: (2024)

Joint-perturbation simultaneous pseudo-gradient
by: Martin, Carlos, et al.
Published: (2024)

An upper bound for the number of chess diagrams without promotion
by: Gourion, Daniel
Published: (2021)

On the Complexity of Correlated Equilibria Beyond Normal-Form Games
by: Anagnostides, Ioannis, et al.
Published: (2026)

The Complexity of Equilibrium Refinements in Potential Games
by: Anagnostides, Ioannis, et al.
Published: (2025)

Verifying Approximate Equilibrium in Auctions
by: Pieroth, Fabian R., et al.
Published: (2024)

Revenue-Optimal Efficient Mechanism Design with General Type Spaces
by: Prasad, Siddharth, et al.
Published: (2025)

Playing games with Large language models: Randomness and strategy
by: Vidler, Alicia, et al.
Published: (2025)

Mechanisms that play a game, not toss a coin
by: Walsh, Toby
Published: (2023)

(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
by: Anagnostides, Ioannis, et al.
Published: (2026)

A Polynomial-Time Algorithm for Variational Inequalities under the Minty Condition
by: Anagnostides, Ioannis, et al.
Published: (2025)

Game-Of-Goals: Using adversarial games to achieve strategic resilience
by: Ghose, Aditya, et al.
Published: (2025)

Computational Lower Bounds for Regret Minimization in Normal-Form Games
by: Anagnostides, Ioannis, et al.
Published: (2024)