
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
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 and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment