The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
type: Item
instance of: scholarly article
title: The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
zbMATH Open document ID: 1458.91030
author: Kousha Etessami
published in: Games and Economic Behavior
publication date: 2021-02-23T00:00:00Z
Mathematics Subject Classification ID: 91A18
Mathematics Subject Classification ID: 91A11
Mathematics Subject Classification ID: 91A06
Mathematics Subject Classification ID: 91A68
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 7314601
zbMATH Keywords: extensive form game
zbMATH Keywords: perfect equilibrium
zbMATH Keywords: quasi-perfect equilibrium
zbMATH Keywords: algorithms
zbMATH Keywords: computational complexity
describes a project that uses: Gambit
MaRDI profile type: Publication
full work available at URL: j.geb.2019.03.006
OpenAlex ID: W3081265119
cites work: "Almost" Implies "Near"
cites work: Computational Complexity
cites work: The Algebraic Geometry of Perfect and Sequential Equilibrium
cites work: The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
cites work: The Complexity of Computing a Nash Equilibrium
cites work: On the Complexity of Nash Equilibria and Other Fixed Points
cites work: The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form
cites work: Nash and correlated equilibria: Some complexity considerations
cites work: The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements
cites work: Q4057549
cites work: The complexity of two-person zero-sum games in extensive form
cites work: Efficient computation of equilibria for extensive two-person games
cites work: Sequential Equilibria
cites work: Q5817864
cites work: SIMPLICIAL APPROXIMATION OF FIXED POINTS
cites work: Game Theory
cites work: Q4369429
cites work: Two examples of strategic equilibrium
cites work: Computing sequential equilibria for two-player games
cites work: Computing a quasi-perfect equilibrium of a two-player game
cites work: Refinements of the Nash equilibrium concept
cites work: Non-cooperative games
cites work: Algorithmic Game Theory
cites work: Q3576736
cites work: On the complexity of the parity argument and other inefficient proofs of existence
cites work: Q4298260
cites work: On the equivalence between (quasi-)perfect and sequential equilibria
cites work: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
cites work: Q5342882
cites work: Twenty Lectures on Algorithmic Game Theory
cites work: The Approximation of Fixed Points of a Continuous Mapping
cites work: Q4070959
cites work: Reexamination of the perfectness concept for equilibrium points in extensive games
cites work: A relation between perfect equilibria in extensive form games and proper equilibria in normal form games
cites work: Q4002161
cites work: Efficient computation of behavior strategies
cites work: Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
cites work: Computing Equilibria of Two-Person Games from the Extensive Form
cites work: A path-following procedure to find a proper equilibrium of finite games
DOI: 10.1016/J.GEB.2019.03.006
description: scientific article; zbMATH DE number 7314601