Finite-state Strategies in Delay Games

@article{Winter2017FinitestateSI,
  title={Finite-state Strategies in Delay Games},
  author={Sarah Winter and Martin Zimmermann},
  journal={ArXiv},
  year={2017},
  volume={abs/1704.08887}
}
What is a finite-state strategy in a delay game? We answer this surprisingly non-trivial question and present a very general framework for computing such strategies: they exist for all winning conditions that are recognized by automata with acceptance conditions that satisfy a certain aggregation property. Our framework also yields upper bounds on the complexity of determining the winner of such delay games and upper bounds on the necessary lookahead to win the game. In particular, we cover all… 

Figures from this paper

Finite-state Strategies in Delay Games (full version)
TLDR
This work presents a very general framework that allows to remove delay: finite-state strategies exist for all winning conditions where the resulting delay-free game admits a finite- state strategy.
What’s to Come is Still Unsure
TLDR
It is demonstrated using benchmark examples that even a simplistic explicit-state implementation of this algorithm outperforms state-of-the-art symbolic synthesis algorithms as soon as non-trivial delays have to be handled.
What's to Come is Still Unsure - Synthesizing Controllers Resilient to Delayed Interaction
TLDR
This work shed some light on the practically relevant case of non-order-preserving delays, as arising in actual networked control, thereby considerably extending the scope of regular game theory under delay pioneered by Klein and Zimmermann.
Indecision and delays are the parents of failure—taming them algorithmically by synthesizing delay-resilient control
TLDR
This work addresses the practically relevant cases of non-order-preserving delays and bounded message loss, as arising in actual networked control, thereby considerably extending the scope of regular game theory under delay.
The Complexity of Transducer Synthesis from Multi-Sequential Specifications
TLDR
Whenever the specification is realisable, the construction of a sequential transducer that realises it and has a size that is doubly exponential is exposed, which is proved to be optimal.
Partially Observable Games for Secure Autonomy*
TLDR
The two-player partially observable stochastic game formalism is proposed to capture both high-level autonomous mission planning under uncertainty and adversarial decision making subject to imperfect information to integrate these two presently distinct areas into a single framework.
Safety Control with Preview Automaton
  • Zexiang Liu, N. Ozay
  • Computer Science, Mathematics
    2019 IEEE 58th Conference on Decision and Control (CDC)
  • 2019
TLDR
This paper proposes preview automaton, a mathematical construct that captures both the preview information and the possible constraints on switching signals and develops an algorithm that computes the maximal invariant set in a given mode-dependent safe set.
Approximating the Minimal Lookahead Needed to Win Infinite Games
TLDR
An exponential-time algorithm approximating the minimal lookahead necessary to win an $\omega$-regular delay game is presented.
Computability of Data-Word Transductions over Different Data Domains
TLDR
This paper identifies a sufficient condition (the possibility of determining the next letter to be outputted, which they call next letter problem) under which computability and continuity coincide, and proves that functionality, i.e. determining whether the relation recognized by the transducer is actually a function, is decidable.

References

SHOWING 1-10 OF 54 REFERENCES
Finite-state Strategies in Delay Games (full version)
TLDR
This work presents a very general framework that allows to remove delay: finite-state strategies exist for all winning conditions where the resulting delay-free game admits a finite- state strategy.
Degrees of Lookahead in Context-free Infinite Games
TLDR
The investigation of delay games, infinite games in which one player may postpone her moves for some time to obtain a lookahead on her opponent's moves, shows that the problem of determining the winner is undecidable for deterministic context-free winning conditions.
Finite-State Strategies in Regular Infinite Games
  • W. Thomas
  • Economics, Computer Science
    FSTTCS
  • 1994
TLDR
This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games, and the construction of winning strategies is described in three stages, covering “guarantee games’, “recurrence games”, and general regular games.
Complexity Bounds for Regular Games
TLDR
A framework in which the expressiveness and succinctness of different types of winning conditions can be compared is established and PSPACE-completeness is established for Emerson-Lei games and for games described by Zielonka DAGs.
Finite State Strategies in One Player McNaughton Games
TLDR
A class of infinite one player games played on finite graphs is considered to find whether or not the player wins the game and how much memory is needed to win the game.
How much memory is needed to win infinite games?
TLDR
This work provides matching upper and lower bounds for the size of memory needed by winning strategies in games with a fixed winning condition and proposes a more succinct way of representing winning strategies by means of parallel compositions of transition systems.
Extending Finite Memory Determinacy to Multiplayer Games
We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite
The surprizing complexity of generalized reachability games
TLDR
It is proved that deciding the winner in such games is $\PSPACE$-complete, although it is fixed-parameter tractable with the number of reachability objectives as parameter, and it is shown that bounding the size of the reachability sets gives two natural subclasses where deciding thewinner can be done efficiently.
Solving sequential conditions by finite-state strategies
Our main purpose is to present an algorithm which decides whether or not a condition 𝕮(X, Y) stated in sequential calculus admits a finite automata solution, and produces one if it exists. This
What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead
TLDR
Determinacy of delay games with Borel winning conditions, infinite-duration two-player games in which one player may delay her moves to obtain a lookahead on her opponent's moves, is proved and different notions of universal strategies for both players are introduced.
...
1
2
3
4
5
...