Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games

Artificial Intelligence 282 (C):103248 (2020)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On composition of bounded-recall plans.Kaya Deuser & Pavel Naumov - 2020 - Artificial Intelligence 289 (C):103399.

Analytics

Added to PP
2020-12-22

Downloads
14 (#1,273,358)

6 months
3 (#1,471,287)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Computer poker: A review.Jonathan Rubin & Ian Watson - 2011 - Artificial Intelligence 175 (5-6):958-987.

Add more references