Attracting tangles to solve parity games

DOI10.1007/978-3-319-96142-2_14zbMath1511.68169arXiv1804.01023OpenAlexW2796106051MaRDI QIDQ6039403

Tom van Dijk

Publication date: 5 May 2023

Published in: Computer Aided Verification (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60) Algorithmic game theory and complexity (91A68)

Related Items (8)

Robust worst cases for parity games algorithms ⋮ Value iteration for simple stochastic games: stopping criterion and learning algorithm ⋮ Justifications and a reconstruction of parity game solving algorithms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A delayed promotion policy for parity games ⋮ Improving parity games in practice

This page was built for publication: Attracting tangles to solve parity games