Equilibria problems on games: complexity versus succinctness
type: Item
instance of: scholarly article
title: Equilibria problems on games: complexity versus succinctness
zbMATH Open document ID: 1230.91006
author: Carme Àlvarez
author: Joaquim Gabarró
author: Maria Serna
published in: Journal of Computer and System Sciences
publication date: 2012-01-11T00:00:00Z
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91A18
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 5996374
zbMATH Keywords: extensive games
zbMATH Keywords: strategic games, Nash equilibria
zbMATH Keywords: complexity classes
zbMATH Keywords: succinct representations
MaRDI profile type: Publication
full work available at URL: j.jcss.2011.01.001
OpenAlex ID: W2094143906
cites work: Algorithms and Computation
cites work: Mathematical Foundations of Computer Science 2005
cites work: Q4321931
cites work: Symmetries and the complexity of pure Nash 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: Algorithms – ESA 2005
cites work: The complexity of pure Nash equilibria
cites work: The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
cites work: Q4737150
cites work: Automata, Languages and Programming
cites work: On the Complexity of Game Isomorphism
cites work: On the Complexity of Equilibria Problems in Angel-Daemon Games
cites work: Q4198056
cites work: Q5715720
cites work: Q5817864
cites work: Algorithmic Game Theory
cites work: Q3512518
cites work: Q3576736
cites work: Q4298260
cites work: Algorithms, games, and the internet
cites work: Computing equilibria in multi-player games
cites work: Computing correlated equilibria in multi-player games
cites work: The Computational Complexity of Nash Equilibria in Concisely Represented Games
cites work: The computational complexity of equivalence and isomorphism problems
DOI: 10.1016/J.JCSS.2011.01.001
description: scientific article; zbMATH DE number 5996374