An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information

Developing scalable solution algorithms is one of the central problems in computational game theory. We present an iterative algorithm for computing an exact Nash equilibrium for two-player zero-sum extensive-form games with imperfect information. Our approach combines two key elements: (1) the comp...

Full description

Bibliographic Details

Published in:	The Journal of artificial intelligence research Vol. 51; pp. 829 - 866
Main Authors:	Bosansky, B., Kiekintveld, C., Lisy, V., Pechoucek, M.
Format:	Journal Article
Language:	English
Published:	San Francisco AI Access Foundation 01.01.2014
Subjects:	Algorithms Artificial intelligence Card games Computation Equilibrium Game theory Games Iterative algorithms Iterative methods Linear programming Search algorithms
ISSN:	1076-9757, 1076-9757, 1943-5037
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!