We prove that the computational problem of finding backward induction outcome is PTIME-complete. © 2013 Springer-Verlag.
CITATION STYLE
Szymanik, J. (2013). Backward induction is PTIME-complete. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8196 LNCS, pp. 352–356). https://doi.org/10.1007/978-3-642-40948-6_32
Mendeley helps you to discover research relevant for your work.