scientific article; zbMATH DE number 6790166

DOI10.23638/LMCS-13(3:29)2017MaRDI QIDQ5367068zbMATH OpenFDO

Authors Alexander Weinert, Martín G. Zimmermann

Publication date 12 October 2017

Full work available at URL https://arxiv.org/abs/1604.05543

zbMATH Keywords

memory requirementsoptimal strategiesparity games with coststradeoffs

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving topology, set theory, or logic (91A44)

Recommendations

• Easy to win, hard to master: optimal strategies in parity games with costs
• Parity and Streett games with costs
• Strategy construction for parity games with imperfect information
• Strategy Construction for Parity Games with Imperfect Information
• Computer Science Logic
• The structure of winning strategies in parallel repetition games
• An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
• On winning strategies in Ehrenfeucht-Fraïssé games
• scientific article; zbMATH DE number 2243403

Cited in

(9)

• Quantitative reductions and vertex-ranked infinite games
• Finite-state strategies in delay games
• Cost-parity and cost-Streett games
• Optimal strategies in weighted limit games
• scientific article; zbMATH DE number 7533361 (Why is no real title available?)
• Parity games with weights
• Easy to win, hard to master: optimal strategies in parity games with costs
• Parity and Streett games with costs
• Stochastic window mean-payoff games

This page was built for publication:

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