The complexity of two-person zero-sum games in extensive form
type: Item
instance of: scholarly article
title: The complexity of two-person zero-sum games in extensive form
zbMATH Open document ID: 0758.90084
DOI: 10.1016/0899-8256(92)90035-Q
author: Daphne Koller
author: Nimrod Megiddo
published in: Games and Economic Behavior
publication date: 1993-01-12T00:00:00Z
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 85740
zbMATH Keywords: complexity of finding max-min strategies
zbMATH Keywords: finite two-person zero-sum games
zbMATH Keywords: extensive form
MaRDI profile type: Publication
cites work: Q5583594
cites work: Q4198056
cites work: Nash and correlated equilibria: Some complexity considerations
cites work: Geometric algorithms and combinatorial optimization
cites work: Finding mixed strategies with small supports in extensive form games
cites work: Extensive Games
cites work: Q5583591
cites work: An Overview of the Mathematical Theory of Games
cites work: Q5815902
cites work: Complete inflation and perfect recall in extensive games
cites work: Q5545175
cites work: Theory of games and economic behavior.
cites work: Computing Equilibria of Two-Person Games from the Extensive Form
full work available at URL: 0899-8256(92)90035-q
OpenAlex ID: W2023373582
description: scientific article; zbMATH DE number 85740