Feb 21, 2016 · The leading approach to solving large imperfect information games is to pre-calculate an approximate solution using a simplified abstraction of the full game.
In this paper, we present a new technique, max-margin subgame refinement, that is tailor-made to reduce ex- ploitability in imperfect information games. We ...
An appealing idea is to use the simplified abstraction to play the early parts of the game and then, once the subgame becomes tractable, to calculate a solution ...
The leading approach to solving large imperfect information games is to pre-calculate an approximate solution using a simplified abstraction of the full ...
This work introduces subgame-solving techniques that outperform prior methods both in theory and practice and shows that subgame solving can be repeated as ...
People also ask
What is an example of a game with imperfect information?
How do you identify subgames in game theory?
What is the difference between perfect information game and imperfect information game?
What is extensive form games with imperfect information?
Abstract. Sequential games of perfect information can be solved by backward induction, where solutions to endgames are prop- agated up the game tree.
Subgame solving is an essential technique in addressing large imperfect information games, with various approaches developed to enhance the performance of ...
In imperfect-information games, the optimal strategy in a subgame may depend on the strategy in other, unreached subgames. Thus a subgame cannot be solved in ...
This is accomplished by constructing augmented subgames that offer the opponent the option to abstain from entering the subgame, thereby compelling the player ...
Subgame solving is an essential technique in addressing large imperfect information games, with various approaches developed to enhance the performance of ...