Games through Nested Fixpoints

DOI10.1007/978-3-642-02658-4_24MaRDI QIDQ3636869zbMATH OpenOpenAlexFDO

Authors Thomas Martin Gawlitza, Helmut Seidl

Publication date 30 June 2009

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02658-4_24

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)

Recommendations

• The complexity of mean payoff games on graphs
• The complexity of solving stochastic games on graphs
• A Survey of Stochastic Games with Limsup and Liminf Objectives
• Stochastic limit-average games are in EXPTIME
• Algorithms for solving parity games

Cited in

(10)

• Looking at mean-payoff and total-payoff through windows
• Average-energy games
• Improving strategies via SMT solving
• scientific article; zbMATH DE number 3915185 (Why is no real title available?)
• Average-energy games
• Life is random, time is not: Markov decision processes with window objectives
• Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
• Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
• Life is random, time is not: Markov decision processes with window objectives
• Expectation in stochastic games with prefix-independent objectives

This page was built for publication: Games through Nested Fixpoints

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