Bounding the support size in extensive form games with imperfect information

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10282497" target="_blank" >RIV/00216208:11320/14:10282497 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8416/850" target="_blank" >http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8416/850</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Bounding the support size in extensive form games with imperfect information

Popis výsledku v původním jazyce

It is a well known fact that in extensive form games with perfect information, there is a Nash equilibrium with support of size one. This doesn't hold for games with imperfect information, where the size of minimal support can be larger. We present a dependency between the level of uncertainty and the minimum support size. For many games, there is a big disproportion between the game uncertainty and the number of actions available. In Bayesian extensive games with perfect information, the only uncertainty is about the type of players. In card games, the uncertainty comes from dealing the deck. In these games, we can significantly reduce the support size. Our result applies to general-sum extensive form games with any finite number of players.

Název v anglickém jazyce

Bounding the support size in extensive form games with imperfect information

Popis výsledku anglicky

It is a well known fact that in extensive form games with perfect information, there is a Nash equilibrium with support of size one. This doesn't hold for games with imperfect information, where the size of minimal support can be larger. We present a dependency between the level of uncertainty and the minimum support size. For many games, there is a big disproportion between the game uncertainty and the number of actions available. In Bayesian extensive games with perfect information, the only uncertainty is about the type of players. In card games, the uncertainty comes from dealing the deck. In these games, we can significantly reduce the support size. Our result applies to general-sum extensive form games with any finite number of players.

Druh

D - Stať ve sborníku

CEP obor

BD - Teorie informace

OECD FORD obor

—

Projekt

<a href="/cs/project/GA13-10660S" target="_blank" >GA13-10660S: Intervalové metody pro optimalizační úlohy</a><br>

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2014

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ů

Název statě ve sborníku

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence

ISBN

978-1-57735-661-5

ISSN

2159-5399

e-ISSN

—

Počet stran výsledku

7

Strana od-do

784-790

Název nakladatele

AAAI Press

Místo vydání

Palo Alto, California

Místo konání akce

Québec, Canada

Datum konání akce

27. 7. 2014

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—