Backward Induction is PTIME-complete Jakub Szymanik∗ Institute of Logic Language and Computation, University of Amsterdam [removed] Abstract. We prove that the computational problem of finding backward induc - Computation tree logic - Document - PDFSEARCH.IO

First Page	Meta Content
	Backward Induction is PTIME-complete Jakub Szymanik∗ Institute of Logic Language and Computation, University of Amsterdam [removed] Abstract. We prove that the computational problem of finding backward induc Add to Reading List Document Date: 2013-07-13 09:14:28 Open Document File Size: 294,55 KB Share Result on Facebook City Springer / Cambridge / / Company Oxford University Press / Hoover / MIT Press / / Country United States / / / Facility PTIME-complete Jakub Szymanik∗ Institute of Logic Language / / IndustryTerm polynomial decision algorithm / parallel processors / inductive algorithm / backward induction solution / / Organization Oxford University / Cognitive Science Society / PTIME-complete Jakub Szymanik∗ Institute of Logic Language and Computation / University of Amsterdam / MIT / / Person Van Benthem / Jakub Szymanik / Veni Grant / / Position first player / existential player / author / player / second player / / ProvinceOrState New York / / Technology ATM / inductive algorithm / polynomial decision algorithm / / SocialTag Complexity classes Finite model theory Graph connectivity Game theory FO Reachability P Extensive-form game Tree Theoretical computer science

Backward Induction is PTIME-complete Jakub Szymanik∗ Institute of Logic Language and Computation, University of Amsterdam [removed] Abstract. We prove that the computational problem of finding backward inducAdd to Reading List