loading
Documentation
  • Login
  • Sign-Up

Research.Publish.Connect.

Paper

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

Affiliation: Czech Technical University in Prague, Czech Republic

ISBN: 978-989-758-220-2

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 recal l games of sizes beyond toy-problems within few minutes. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SCITEPRESS user or Join INSTICC now for free.

Sign In SCITEPRESS user: please login.

Sign In INSTICC Members: please login. If not a member yet, Join INSTICC now for free.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.156.32.80. INSTICC members have higher download limits (free membership now)

In the current month:
Recent papers: 1 available of 1 total
2+ years older papers: 2 available of 2 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 2: ICAART, ISBN 978-989-758-220-2, 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 2: ICAART,},
year={2017},
pages={63-74},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006121200630074},
isbn={978-989-758-220-2},
}

TY - CONF

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

Sorted by: Show papers

Note: The preferred Subjects/Areas/Topics, listed below for each paper, are those that match the selected paper topics and their ontology superclasses.
More...

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.

Show authors

Note: The preferred Subjects/Areas/Topics, listed below for each author, are those that more frequently used in the author's papers.
More...