Combining Compact Representation and Incremental Generation in Large Games with Sequential Strategies
نویسندگان
چکیده
Many search and security games played on a graph can be modeled as normal-form zero-sum games with strategies consisting of sequences of actions. The size of the strategy space provides a computational challenge when solving these games. This complexity is tackled either by using the compact representation of sequential strategies and linear programming, or by incremental strategy generation of iterative double-oracle methods. In this paper, we present novel hybrid of these two approaches: compact-strategy doubleoracle (CS-DO) algorithm that combines the advantages of the compact representation with incremental strategy generation. We experimentally compare CS-DO with the standard approaches and analyze the impact of the size of the support on the performance of the algorithms. Results show that CS-DO dramatically improves the convergence rate in games with non-trivial support.
منابع مشابه
Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games
Extensive-form games with imperfect recall are an important model of dynamic games where the players are allowed to forget previously known information. Often, imperfect recall games are the result of an abstraction algorithm that simplifies a large game with perfect recall. Unfortunately, solving an imperfect recall game has fundamental problems since a Nash equilibrium does not have to exist....
متن کاملResource Graph Games: A Compact Representation for Games with Structured Strategy Spaces (Extended Abstract)
There has been increasing interest in using game theory to model real-world systems, and in the computation of game-theoretic solution concepts given such a model [14]. The efficiency of game-theoretic computations depends crucially on how games are represented. For multiagent systems with large numbers of agents and actions, the standard normal form game representation is not a practical optio...
متن کاملIncremental LDA Learning by Combining Reconstructive and Discriminative Approaches
Incremental subspace methods have proven to enable efficient training if large amounts of training data have to be processed or if not all data is available in advance. In this paper we focus on incremental LDA learning which provides good classification results while it assures a compact data representation. In contrast to existing incremental LDA methods we additionally consider reconstructiv...
متن کاملCounterfactual Regret Minimization in Sequential Security Games
Many real world security problems can be modelled as finite zero-sum games with structured sequential strategies and limited interactions between the players. An abstract class of games unifying these models are the normal-form games with sequential strategies (NFGSS). We show that all games from this class can be modelled as well-formed imperfect-recall extensiveform games and consequently can...
متن کاملComputing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall
Extensive-form games with imperfect recall are an important game-theoretic model that allows a compact representation of strategies in dynamic strategic interactions. Practical use of imperfect recall games is limited due to negative theoretical results: a Nash equilibrium does not have to exist, computing maxmin strategies is NP-hard, and they may require irrational numbers. We present the fir...
متن کامل