Skip to main content
SpringerLink
Log in

Backward Induction Is PTIME-complete

  • Conference paper
Logic, Rationality, and Interaction (LORI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8196))

Included in the following conference series:

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Szymanik, J., Meijering, B., Verbrugge, R.: Using intrinsic complexity of turn-taking games to predict participants’ reaction times. In: Knauff, M., Pauen, M., Sebanz, N., Wachsmuth, I. (eds.) Proceedings of the 35th Annual Conference of the Cognitive Science Society, pp. 1426–1432. Cognitive Science Society, Austin (2013)

    Google Scholar 

  2. van Benthem, J., Gheerbrant, A.: Game solution, epistemic dynamics and fixed-point logics. Fundamenta Informaticae 100(1-4), 19–41 (2010)

    MathSciNet  MATH  Google Scholar 

  3. Immerman, N.: Descriptive Complexity. Texts in Computer Science. Springer, New York (1998)

    Google Scholar 

  4. Immerman, N.: Number of quantifiers is better than number of tape cells. Journal of Computer and System Sciences 22(3), 384–406 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114–133 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  6. Greenlaw, R., Hoover, J.H., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, USA (1995)

    MATH  Google Scholar 

  7. Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (1994)

    MATH  Google Scholar 

  8. Edmonds, J.: Paths, trees, and flowers. Canadian Journal of Mathematics 17, 449–467 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  9. Frixione, M.: Tractable competence. Minds and Machines 11(3), 379–397 (2001)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Logic Language and Computation, University of Amsterdam, The Netherlands

    Jakub Szymanik

Authors
  1. Jakub Szymanik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Liverpool, Ashton Building, Ashton Street, L69 3BX, Liverpool, UK

    Davide Grossi

  2. Fakultät für Philosophie, Ludwig-Maximilians-Universität München, Geschwister-Scholl-Platz 1, 80539, München, Germany

    Olivier Roy

  3. Center for the Study of Language and Cognition, Zhejiang University, Xixi Campus, Tianmushan Road 148, 310028,, Hangzhou, China

    Huaxin Huang

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Szymanik, J. (2013). Backward Induction Is PTIME-complete. In: Grossi, D., Roy, O., Huang, H. (eds) Logic, Rationality, and Interaction. LORI 2013. Lecture Notes in Computer Science, vol 8196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40948-6_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40948-6_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40947-9

  • Online ISBN: 978-3-642-40948-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation