
Be the first to like this
Published on
Survey of computational complexity or computability of sequential decision making (games, planning)
contains two more detailed proofs:
 EXPSPACE completeness of unobservable adversarial planning for existence of 100% winning strategy (Hasslum et al)
 undecidability of unobservable adversarial planning for arbitrary winning rate (including optimal play in the Nash sense)
Clipping is a handy way to collect important slides you want to go back to later.
Be the first to comment