C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Approximating the minimal lookahead needed to win infinite games.
Martin Zimmermann
Published in:
Inf. Process. Lett. (2022)
Keyphrases
</>
data sets
game theory
video games
game tree
nash equilibria
game play
game design
database
artificial intelligence
case study
simulated annealing
nash equilibrium
serious games
finite dimensional
perfect information