IRIS

We prove that the computational problem of finding backward induction outcome is PTIME-complete. © 2013 Springer-Verlag.

Backward induction is PTIME-complete / Szymanik, J.. - 8196 LNCS:(2013), pp. 352-356. ( 4th International Workshop on Logic, Rationality, and Interaction, LORI 2013 Hangzhou 2013) [10.1007/978-3-642-40948-6_32].

Backward induction is PTIME-complete

Szymanik, J.
2013-01-01

Abstract

We prove that the computational problem of finding backward induction outcome is PTIME-complete. © 2013 Springer-Verlag.
2013
Proceedings of the 4th International Workshop on Logic, Rationality, and Interaction
Berlin
Springer
9783642409479
2-s2.0-84886433695
WOS:000329929700032
Szymanik, J.
Backward induction is PTIME-complete / Szymanik, J.. - 8196 LNCS:(2013), pp. 352-356. ( 4th International Workshop on Logic, Rationality, and Interaction, LORI 2013 Hangzhou 2013) [10.1007/978-3-642-40948-6_32].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/369756
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 4
  • OpenAlex ND
social impact