Nearest fixed points and concurrent priority games

DOI10.1007/978-3-319-22177-9_29zbMATH Open1436.68213OpenAlexW2284877434MaRDI QIDQ2947896FDOQ2947896

Authors: Bruno Karelovic, Wiesław Zielonka 

Publication date: 29 September 2015

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22177-9_29

Recommendations

• Deterministic Priority Mean-Payoff Games as Limits of Discounted Games
• Perfect Information Stochastic Priority Games
• The variable hierarchy for the games \(\mu \)-calculus
• Qualitative concurrent parity games
• Quantitative stochastic parity games

Mathematics Subject Classification ID

Applications of game theory (91A80) Games involving graphs (91A43) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• A lattice-theoretical fixpoint theorem and its applications
• The determinacy of Blackwell games
• Title not available (Why is that?)
• Monadic second-order logic on tree-like structures
• Title not available (Why is that?)
• Quantitative solution of omega-regular games
• Title not available (Why is that?)
• Rudiments of \(\mu\)-calculus
• Qualitative concurrent parity games

Cited In (2)

• Characterizations of solutions for games with precedence constraints
• Memoryless determinacy of finite parity games: another simple proof

This page was built for publication: Nearest fixed points and concurrent priority games

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