Fictitious self-play in extensive-form games

J Heinrich, M Lanctot, D Silver - International conference on …, 2015 - proceedings.mlr.press
Fictitious play is a popular game-theoretic model of learning in games. However, it has
received little attention in practical applications to large problems. This paper introduces two …

XDO: A double oracle algorithm for extensive-form games

S McAleer, JB Lanier, KA Wang… - Advances in Neural …, 2021 - proceedings.neurips.cc
Abstract Policy Space Response Oracles (PSRO) is a reinforcement learning (RL) algorithm
for two-player zero-sum games that has been empirically shown to find approximate Nash …

Faster game solving via predictive blackwell approachability: Connecting regret matching and mirror descent

G Farina, C Kroer, T Sandholm - … of the AAAI Conference on Artificial …, 2021 - ojs.aaai.org
Blackwell approachability is a framework for reasoning about repeated games with vector-
valued payoffs. We introduce predictive Blackwell approachability, where an estimate of the …

Solving large-scale pursuit-evasion games using pre-trained strategies

S Li, X Wang, Y Zhang, W Xue, J Černý… - Proceedings of the AAAI …, 2023 - ojs.aaai.org
Pursuit-evasion games on graphs model the coordination of police forces chasing a fleeing
felon in real-world urban settings, using the standard framework of imperfect-information …

Faster algorithms for extensive-form game solving via improved smoothing functions

C Kroer, K Waugh, F Kılınç-Karzan… - Mathematical …, 2020 - Springer
Sparse iterative methods, in particular first-order methods, are known to be among the most
effective in solving large-scale two-player zero-sum extensive-form games. The …

[HTML][HTML] Co-optimization of multiple virtual power plants considering electricity-heat-carbon trading: A Stackelberg game strategy

J Cao, D Yang, P Dehghanian - International Journal of Electrical Power & …, 2023 - Elsevier
With the improvement of the electricity-heat-carbon trading mechanism, it has been a trend
for multiple virtual power plants (MVPP) to participate in the market competition. Firstly, in …

Optimizing honeypot strategies against dynamic lateral movement using partially observable stochastic games

K Horák, B Bošanský, P Tomášek, C Kiekintveld… - Computers & …, 2019 - Elsevier
Partially observable stochastic games (POSGs) are a general game-theoretic model for
capturing dynamic interactions where players have partial information. The existing …

Heuristic search value iteration for one-sided partially observable stochastic games

K Horák, B Bošanský, M Pěchouček - Proceedings of the AAAI …, 2017 - ojs.aaai.org
Security problems can be modeled as two-player partially observable stochastic games with
one-sided partial observability and infinite horizon (one-sided POSGs). We seek for optimal …

Better regularization for sequential decision spaces: Fast convergence rates for Nash, correlated, and team equilibria

G Farina, C Kroer, T Sandholm - arxiv preprint arxiv:2105.12954, 2021 - arxiv.org
We study the application of iterative first-order methods to the problem of computing
equilibria of large-scale two-player extensive-form games. First-order methods must typically …

Approximate solutions for attack graph games with imperfect information

K Durkota, V Lisý, B Bošanský, C Kiekintveld - Decision and Game Theory …, 2015 - Springer
We study the problem of network security hardening, in which a network administrator
decides what security measures to use to best improve the security of the network …