Imagen de Portada

Domain-Independent Game Abstraction using Word Embedding Techniques

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kim, Juho, Sandholm, Tuomas
Formato:	Preprint
Publicado:	2026
Materias:	Computer Science and Game Theory Artificial Intelligence
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Parallelizing Counterfactual Regret Minimization
por: Kim, Juho, et al.
Publicado: (2026)

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

General search techniques without common knowledge for imperfect-information games, and application to superhuman Fog of War chess
por: Zhang, Brian Hu, et al.
Publicado: (2025)

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

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

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

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

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

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

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

Beyond Outcome-Based Imperfect-Recall: Higher-Resolution Abstractions for Imperfect-Information Games
por: Fu, Yanchang, et al.
Publicado: (2025)

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

Approximate State Abstraction for Markov Games
por: Ishibashi, Hiroki, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
por: Anagnostides, Ioannis, et al.
Publicado: (2025)

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

Policy Abstraction and Nash Refinement in Tree-Exploiting PSRO
por: Konicki, Christine, et al.
Publicado: (2025)

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

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

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

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

KrwEmd: Revising the Imperfect-Recall Abstraction from Forgetting Everything
por: Fu, Yanchang, et al.
Publicado: (2025)

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

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

Autoformalization of Game Descriptions using Large Language Models
por: Mensfelt, Agnieszka, et al.
Publicado: (2024)

Independence of Approximate Clones
por: Delemazure, Théo
Publicado: (2026)

Empirical Validation of the Independent Chip Model
por: Kim, Juho
Publicado: (2025)

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

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

Game Networks
por: La Mura, Pierfrancesco
Publicado: (2013)

Boolean Observation Games
por: van Ditmarsch, Hans, et al.
Publicado: (2022)