Solving Imperfect Recall Games

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00311822" target="_blank" >RIV/68407700:21230/17:00311822 - isvavai.cz</a>

Result on the web

<a href="https://dl.acm.org/citation.cfm?id=3091452" target="_blank" >https://dl.acm.org/citation.cfm?id=3091452</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Solving Imperfect Recall Games

Original language description

Imperfect recall games remain an unexplored part of the game theory, even though recent results in abstraction algorithms show that the imperfect recall might be the key to solving the immense games found in the real world efficiently. Our research objective is to develop the first algorithm capable of outperforming the state-of-the-art solvers applied directly to perfect recall games, by creating and solving its imperfect recall abstraction. To achieve this, we need to answer a set of open questions considering the imperfect recall games. Namely (1) what properties allow the existence of Nash equilibrium in behavioral strategies in imperfect recall games and (2) what information are the players allowed to forget to guarantee that the resulting imperfect recall game can be used to solve the original game with a bounded error.

Czech name

—

Czech description

—

Type

O - Miscellaneous

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA15-23235S" target="_blank" >GA15-23235S: Abstractions and Extensive-Form Games with Imperfect Recall</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů