AI Chat AI Image Generator AI Video Text to Speech

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

page 1

page 2

page 3

page 4

Related Research

research
∙ 11/14/2022

Infinite horizon for symetric strategy population game

To predict the behavior of a population game when time becomes very long...
0 Meziane Privat, et al. ∙
research
∙ 12/16/2020

Listing Small Minimal Separators of a Graph

Let G be a graph and a,b vertices of G. A minimal a,b-separator of G is ...
0 Tuukka Korhonen, et al. ∙
research
∙ 07/25/2017

On the Exponential Rate of Convergence of Fictitious Play in Potential Games

The paper studies fictitious play (FP) learning dynamics in continuous t...
0 Brian Swenson, et al. ∙
research
∙ 01/08/2021

An iterative algorithm for approximating roots of integers

We explore an algorithm for approximating roots of integers, discuss its...
0 William Gerst, et al. ∙
research
∙ 04/15/2018

Approximating the covariance ellipsoid

We explore ways in which the covariance ellipsoid B={v ∈R^d : E <X,v>^2...
0 Shahar Mendelson, et al. ∙
research
∙ 11/10/2020

Decision times of infinite computations

The decision time of an infinite time algorithm is the supremum of its h...
0 Merlin Carl, et al. ∙
research
∙ 11/14/2014

Optimal Cost Almost-sure Reachability in POMDPs

We consider partially observable Markov decision processes (POMDPs) with...
0 Krishnendu Chatterjee, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal