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”

Complexity and Algorithms for Exploiting Quantal Opponents in Large Two-Player Games

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F21%3A00351025" target="_blank" >RIV/68407700:21230/21:00351025 - isvavai.cz</a>

  • Result on the web

    <a href="https://ojs.aaai.org/index.php/AAAI/article/view/16701" target="_blank" >https://ojs.aaai.org/index.php/AAAI/article/view/16701</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Complexity and Algorithms for Exploiting Quantal Opponents in Large Two-Player Games

  • Original language description

    Solution concepts of traditional game theory assume entirely rational players; therefore, their ability to exploit subrational opponents is limited. One type of subrationality that describes human behavior well is the quantal response. While there exist algorithms for computing solutions against quantal opponents, they either do not scale or may provide strategies that are even worse than the entirely-rational Nash strategies. This paper aims to analyze and propose scalable algorithms for computing effective and robust strategies against a quantal opponent in normal-form and extensive-form games. Our contributions are: (1) we define two different solution concepts related to exploiting quantal opponents and analyze their properties; (2) we prove that computing these solutions is computationally hard;(3) therefore, we evaluate several heuristic approximations based on scalable counterfactual regret minimization (CFR); and (4) we identify a CFR variant that exploits the bounded opponents better than the previously used variants while being less exploitable by the worst-case perfectly-rational opponent.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

    <a href="/en/project/GJ18-27483Y" target="_blank" >GJ18-27483Y: Online Solution Methods for Imperfect-Information Games</a><br>

  • Continuities

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

Others

  • Publication year

    2021

  • 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

  • Article name in the collection

    Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence

  • ISBN

    978-1-57735-866-4

  • ISSN

  • e-ISSN

    2374-3468

  • Number of pages

    9

  • Pages from-to

    5575-5583

  • Publisher name

    Association for the Advancement of Artificial Intelligence (AAAI)

  • Place of publication

    Palo Alto, California

  • Event location

    Virtual Conference

  • Event date

    Feb 2, 2021

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000680423505079