Faster Algorithms for Finitary Games

DOI10.1007/978-3-540-71209-1_36MaRDI QIDQ5758126zbMATH OpenOpenAlexFDO

Authors Florian Horn

Publication date 3 September 2007

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71209-1_36

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of game theory (91A80)

Recommendations

• Finitary winning in \({\omega}\)-regular games
• Tools and Algorithms for the Construction and Analysis of Systems
• Stochastic Games with Finitary Objectives
• Cost-parity and cost-Streett games
• On promptness in parity games

Cited in

(9)

• From liveness to promptness
• Faster algorithms for extensive-form game solving via improved smoothing functions
• Finitary winning in \({\omega}\)-regular games
• Finitary languages
• Stochastic Games with Finitary Objectives
• On Reachability Games of Ordinal Length
• Tools and Algorithms for the Construction and Analysis of Systems
• Stochastic window mean-payoff games
• Stochastic window mean-payoff games

This page was built for publication: Faster Algorithms for Finitary Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758126)