Backward Induction is PTIME-complete
| Authors | |
|---|---|
| Publication date | 2013 |
| Host editors |
|
| Book title | Logic, Rationality, and Interaction |
| Book subtitle | 4th International Workshop, LORI 2013, Hangzhou, China, October 9-12, 2013 : proceedings |
| ISBN |
|
| ISBN (electronic) |
|
| Series | Lecture Notes in Computer Science |
| Event | 4th International Workshop on Logic, Rationality, and Interaction, LORI 2013 |
| Pages (from-to) | 352-356 |
| Publisher | Heidelberg: Springer |
| Organisations |
|
| Abstract | We prove that the computational problem of finding backward induction outcome is PTIME-complete. |
| Document type | Conference contribution |
| Language | English |
| Published at |
https://doi.org/10.1007/978-3-642-40948-6_32
(Final published version)
|
| Permalink to this page | |
