Complexity of rational and irrational Nash equilibria
type: Item
instance of: scholarly article
title: Complexity of rational and irrational Nash equilibria
zbMATH Open document ID: 1380.91029
author: Vittorio Bilò
author: Marios Mavronicolas
published in: Theory of Computing Systems
publication date: 2017-11-07T00:00:00Z
Mathematics Subject Classification ID: 91A35
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 91A10
zbMATH DE Number: 6803517
zbMATH Keywords: complexity theory
zbMATH Keywords: decision problems
zbMATH Keywords: strategic games
zbMATH Keywords: Nash equilibria
MaRDI profile type: Publication
full work available at URL: s00224-013-9523-7
OpenAlex ID: W2104892205
cites work: The myth of the folk theorem
cites work: Settling the complexity of computing two-player Nash equilibria
cites work: On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
cites work: New complexity results about Nash equilibria
cites work: The complexity of theorem-proving procedures
cites work: The Complexity of Computing a Nash Equilibrium
cites work: On the Complexity of Nash Equilibria and Other Fixed Points
cites work: When the Players Are Not Expectation Maximizers
cites work: Q4155835
cites work: Q4198056
cites work: Nash and correlated equilibria: Some complexity considerations
cites work: On the complexity of the parity argument and other inefficient proofs of existence
cites work: Simple complexity from imitation games
cites work: Equilibrium points in n -person games
cites work: Non-cooperative games
DOI: 10.1007/S00224-013-9523-7
description: scientific article; zbMATH DE number 6803517