Games with a Weak Adversary

DOI10.1007/978-3-662-43951-7_10zbMath1409.68169arXiv1404.5453OpenAlexW1508811488MaRDI QIDQ5167831

Laurent Doyen, Krishnendu Chatterjee

Publication date: 1 July 2014

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

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

Mathematics Subject Classification ID

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

Related Items (5)

What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives ⋮ Imperfect information in reactive modules games ⋮ Most General Property-Preserving Updates ⋮ Static and dynamic property-preserving updates ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes

This page was built for publication: Games with a Weak Adversary