Finding a Nash equilibrium in spatial games is an NP-complete problem
type: Item
instance of: scholarly article
title: Finding a Nash equilibrium in spatial games is an NP-complete problem
zbMATH Open document ID: 1065.91010
author: Richard Baron
author: Jacques Durieu
author: Hans Haller
author: Philippe Solal
published in: Economic Theory
publication date: 2004-03-11T00:00:00Z
full work available at URL: 0219.pdf
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A10
zbMATH DE Number: 2055119
zbMATH Keywords: Spatial games
zbMATH Keywords: NP-completeness
zbMATH Keywords: Graph \(k\)-colorability.
MaRDI profile type: Publication
OpenAlex ID: W2011808708
DOI: 10.1007/S00199-003-0376-1
Recommended article: Q3524711
Recommended article: Finding all pure strategy Nash equilibria in a planar location game
Recommended article: Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems
Recommended article: Nash equilibrium in a spatial model of coalition bargaining
Recommended article: On the Complexity of Nash Equilibria and Other Fixed Points
Recommended article: Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach
Recommended article: Reachability of locational Nash equilibria
Recommended article: Nash Equilibria in Voronoi Games on Graphs
Recommended article: Q3191570
description: scientific article; zbMATH DE number 2055119