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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

Memory and perfect recall in extensive games.Giacomo Bonanno - 2004 - Games and Economic Behavior 47 (2):237-256.
The normal form is not sufficient.Antonio Quesada - 2001 - Economics and Philosophy 17 (2):235-243.
Partiality and games: propositional logic.G. Sandu & A. Pietarinen - 2001 - Logic Journal of the IGPL 9 (1):101-121.
Bounds to Memory Loss.Hans K. Hvide - 1999 - Theory and Decision 46 (1):1-21.
Information Tracking in Games on Graphs.Dietmar Berwanger & Łukasz Kaiser - 2010 - Journal of Logic, Language and Information 19 (4):395-412.
A Modal Logic for Mixed Strategies.Joshua Sack & Wiebe van der Hoek - 2014 - Studia Logica 102 (2):339-360.
On the logic of informational independence and its applications.Gabriel Sandu - 1993 - Journal of Philosophical Logic 22 (1):29 - 60.

Analytics

Added to PP
2020-12-22

Downloads
9 (#1,219,856)

6 months
6 (#522,885)

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