On Memoryless Quantitative Objectives
From MaRDI portal
Publication:3088278
DOI10.1007/978-3-642-22953-4_13zbMath1342.91005arXiv1104.3211OpenAlexW1593653474MaRDI QIDQ3088278
Laurent Doyen, Rohit Singh, Krishnendu Chatterjee
Publication date: 19 August 2011
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.3211
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the positional determinacy of edge-labeled games
- Positional strategies for mean payoff games
- Borel determinacy
- The complexity of mean payoff games on graphs
- Automata, logics, and infinite games. A guide to current research
- Weighted automata and weighted logics
- Quantitative languages
- Church Synthesis Problem for Noisy Input
- Beyond $\omega$-Regular Languages
- Alternating-time temporal logic
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Energy Parity Games
- Half-Positional Determinacy of Infinite Games
- Stochastic Games with Perfect Information and Time Average Payoff
- Stochastic Games
- CONCUR 2005 – Concurrency Theory
- Stochastic games
This page was built for publication: On Memoryless Quantitative Objectives