The Complexity of Request-Response Games

DOI10.1007/978-3-642-21254-3_17zbMATH Open1330.68105OpenAlexW86633464MaRDI QIDQ3004582FDOQ3004582

Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn

Publication date: 3 June 2011

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21254-3_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games involving graphs (91A43)

Cited In (5)

• Timed games with bounded window parity objectives
• Title not available (Why is that?)
• Quantitative reductions and vertex-ranked infinite games
• Finite-state strategies in delay games
• Title not available (Why is that?)

This page was built for publication: The Complexity of Request-Response Games

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