All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00224949" target="_blank" >RIV/68407700:21230/14:00224949 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.jair.org/papers/paper4477.html" target="_blank" >http://www.jair.org/papers/paper4477.html</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information

  • Original language description

    Developing scalable solution algorithms is one of the central problems in computational game theory. We present an iterative algorithm for computing an exact Nash equilibrium for two-player zero-sum extensive-form games with imperfect information. Our approach combines two key elements: (1) the compact sequence-form representation of extensive-form games and (2) the algorithmic framework of double-oracle methods. The main idea of our algorithm is to restrict the game by allowing the players to play onlyselected sequences of available actions. After solving the restricted game, new sequences are added by finding best responses to the current solution using fast algorithms. We experimentally evaluate our algorithm on a set of games inspired by patrolling scenarios, board, and card games. The results show significant runtime improvements in games admitting an equilibrium with small support, and substantial improvement in memory use even on games with large support. The improvement in mem

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F12%2F2054" target="_blank" >GAP202/12/2054: Security Games in Extensive Form</a><br>

  • Continuities

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

Others

  • Publication year

    2014

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Journal of Artificial Intelligence Research

  • ISSN

    1076-9757

  • e-ISSN

  • Volume of the periodical

    51

  • Issue of the periodical within the volume

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    38

  • Pages from-to

    829-866

  • UT code for WoS article

    000350466400011

  • EID of the result in the Scopus database