Login / Signup
Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games.
Jirí Cermák
Branislav Bosanský
Michal Pechoucek
Published in:
AAMAS (2017)
Keyphrases
</>
branch and bound search
mixed strategy
search strategy
search strategies
optimal strategy
search algorithm
constraint optimization
branch and bound
search heuristics
search tree
nash equilibrium
video games
game theory
arc consistency
constraint programming
cutting plane algorithm
computer games
data structure