Reproduce “Approximating the Value of Time-Bounded Weighted Timed Games” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Isa Vialard, Joël Ouaknine
The authors show that approximation of strategic cost is computable for time-bounded weighted timed games, where Min seeks a low-cost path to a target against Max and costs accrue during delays and transitions. They prove value iteration converges, with a triple-exponential iteration bound, yielding a 4-ExpTime upper bound for precision. This does not decide exact values, which can remain undecidable.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.