Perfect Information Stochastic Priority Games

DOI10.1007/978-3-540-73420-8_73MaRDI QIDQ5428864zbMATH OpenOpenAlexFDO

Authors Hugo Gimbert, Wiesław Zielonka

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73420-8_73

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Stochastic games, stochastic differential games (91A15)

Recommendations

• Foundations of Software Science and Computation Structures
• Perfect-information stochastic mean-payoff parity games
• Perfect information stochastic games and related classes
• Perfect-information stochastic games with generalized mean-payoff objectives
• Pure Strategies in Imperfect Information Stochastic Games
• Perfect equilibria in games of incomplete information
• Perfect information games with upper semicontinuous payoffs
• Publication:4504053
• Parameterized games of perfect information

Cited in

(10)

• Model checking games for the quantitative \(\mu \)-calculus
• Discounting infinite games but how and why?
• Blackwell optimal strategies in priority mean-payoff games
• Nearest fixed points and concurrent priority games
• Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games
• The mu-calculus and Model Checking
• Deterministic Priority Mean-Payoff Games as Limits of Discounted Games
• Blackwell-optimal strategies in priority mean-payoff games
• Foundations of Software Science and Computation Structures
• Submixing and shift-invariant stochastic games

This page was built for publication: Perfect Information Stochastic Priority Games

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