Subgame optimal strategies in finite concurrent games with prefix-independent objectives

DOI10.1007/978-3-031-30829-1_26arXiv2301.10697OpenAlexW4366550830MaRDI QIDQ6091217

Benjamin Bordais, Stéphane Le Roux, Patricia Bouyer

Publication date: 24 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.10697

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Randomness for free
• Automatic verification of concurrent stochastic systems
• Qualitative analysis of concurrent mean-payoff games
• Concurrent games with tail objectives
• Graph Games and Reactive Synthesis
• The complexity of quantitative concurrent parity games
• The determinacy of Blackwell games
• Stochastic Games with Perfect Information and Time Average Payoff
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Subgame optimal strategies in finite concurrent games with prefix-independent objectives