loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Branislav Bosansky ; Jiri Cermak ; Karel Horak and Michal Pechoucek

Affiliation: Czech Technical University in Prague, Czech Republic

Keyword(s): Game Theory, Imperfect Recall, Maxmin Strategies.

Related Ontology Subjects/Areas/Topics: Agents ; Artificial Intelligence ; Artificial Intelligence and Decision Support Systems ; Distributed and Mobile Software Systems ; Economic Agent Models ; Enterprise Information Systems ; Knowledge Engineering and Ontology Development ; Knowledge-Based Systems ; Multi-Agent Systems ; Software Engineering ; Symbolic Systems ; Uncertainty in AI

Abstract: Extensive-form games with imperfect recall are an important game-theoretic model that allows a compact representation of strategies in dynamic strategic interactions. Practical use of imperfect recall games is limited due to negative theoretical results: a Nash equilibrium does not have to exist, computing maxmin strategies is NP-hard, and they may require irrational numbers. We present the first algorithm for approximating maxmin strategies in two-player zero-sum imperfect recall games without absentmindedness. We modify the well-known sequence-form linear program to model strategies in imperfect recall games resulting in a bilinear program and use a recent technique to approximate the bilinear terms. Our main algorithm is a branch-and-bound search that provably reaches the desired approximation after an exponential number of steps in the size of the game. Experimental evaluation shows that the proposed algorithm can approximate maxmin strategies of randomly generated imperfect reca ll games of sizes beyond toy-problems within few minutes. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.222.182.105

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Bosansky, B.; Cermak, J.; Horak, K. and Pechoucek, M. (2017). Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall. In Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART; ISBN 978-989-758-220-2; ISSN 2184-433X, SciTePress, pages 63-74. DOI: 10.5220/0006121200630074

@conference{icaart17,
author={Branislav Bosansky. and Jiri Cermak. and Karel Horak. and Michal Pechoucek.},
title={Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall},
booktitle={Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2017},
pages={63-74},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006121200630074},
isbn={978-989-758-220-2},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
TI - Computing Maxmin Strategies in Extensive-form Zero-sum Games with Imperfect Recall
SN - 978-989-758-220-2
IS - 2184-433X
AU - Bosansky, B.
AU - Cermak, J.
AU - Horak, K.
AU - Pechoucek, M.
PY - 2017
SP - 63
EP - 74
DO - 10.5220/0006121200630074
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic