Effectiveness of Game-Theoretic Strategies in Extensive-Form General-Sum Games

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00234820" target="_blank" >RIV/68407700:21230/15:00234820 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Effectiveness of Game-Theoretic Strategies in Extensive-Form General-Sum Games

Popis výsledku v původním jazyce

Game theory is a descriptive theory dening the conditions for the strategies of rational agents to form an equilibrium (a.k.a. the so- lution concepts). From the prescriptive viewpoint, game theory generally fails (e.g., when multiple Nash equilibria exist) and can only serve as a heuristic for agents. Extensive-form general-sum games have a plethora of solution concepts, each posing specic assumptions about the play-ers. Unfortunately, there is no comparison of the eectiveness of the solution-concept strategies that would serve as a guideline for selecting the most efective algorithm for a given domain. We provide this com-parison and evaluate the effectiveness of solution-concept strategies and strategies computed by Counterfactual regret minimization (CFR) and Monte Carlo Tree Search in practice. Our results show that (1) CFR strategies perform typically the best, (2) the effectiveness of the Nash equilibrium and its renements is closely related to the correlation be-tween the utili

Název v anglickém jazyce

Effectiveness of Game-Theoretic Strategies in Extensive-Form General-Sum Games

Popis výsledku anglicky

Game theory is a descriptive theory dening the conditions for the strategies of rational agents to form an equilibrium (a.k.a. the so- lution concepts). From the prescriptive viewpoint, game theory generally fails (e.g., when multiple Nash equilibria exist) and can only serve as a heuristic for agents. Extensive-form general-sum games have a plethora of solution concepts, each posing specic assumptions about the play-ers. Unfortunately, there is no comparison of the eectiveness of the solution-concept strategies that would serve as a guideline for selecting the most efective algorithm for a given domain. We provide this com-parison and evaluate the effectiveness of solution-concept strategies and strategies computed by Counterfactual regret minimization (CFR) and Monte Carlo Tree Search in practice. Our results show that (1) CFR strategies perform typically the best, (2) the effectiveness of the Nash equilibrium and its renements is closely related to the correlation be-tween the utili

Druh

O - Ostatní výsledky

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2015

Kód důvěrnosti údajů

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