Faster Algorithms for Finitary Games

DOI10.1007/978-3-540-71209-1_36zbMath1186.68294OpenAlexW1594742631MaRDI QIDQ5758126

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

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

Related Items (4)

Stochastic Games with Finitary Objectives ⋮ Optimal strategy synthesis for request-response games ⋮ Stochastic window mean-payoff games ⋮ From liveness to promptness

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