Approximating the Minimal Lookahead Needed to Win Infinite Games

10/22/2020 ∙ by Martin Zimmermann, et al. ∙ 0

We present an exponential-time algorithm approximating the minimal lookahead necessary to win an ω-regular delay game.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.