Non-oblivious Strategy Improvement

DOI10.1007/978-3-642-17511-4_13zbMath1310.91040arXiv1003.2976OpenAlexW3122185350MaRDI QIDQ3066101

John Fearnley

Publication date: 7 January 2011

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

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

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43)

Related Items (10)

Symmetric Strategy Improvement ⋮ Robust worst cases for parity games algorithms ⋮ Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games ⋮ Solving mean-payoff games via quasi dominions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A superpolynomial lower bound for strategy iteration based on snare memorization ⋮ The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs ⋮ Solving parity games via priority promotion ⋮ Unnamed Item

This page was built for publication: Non-oblivious Strategy Improvement