Finding a Nash Equilibrium in Spatial Games is an NP-Complete Problem
Publikation: Working paper › Forskning
Standard
Finding a Nash Equilibrium in Spatial Games is an NP-Complete Problem. / Baron, Richard; Durieu, Jacques; Haller, Hans Hermann; Solal, Philippe.
Department of Economics, University of Copenhagen, 2002.Publikation: Working paper › Forskning
Harvard
Baron, R, Durieu, J, Haller, HH & Solal, P 2002 'Finding a Nash Equilibrium in Spatial Games is an NP-Complete Problem' Department of Economics, University of Copenhagen.
APA
Baron, R., Durieu, J., Haller, H. H., & Solal, P. (2002). Finding a Nash Equilibrium in Spatial Games is an NP-Complete Problem. Department of Economics, University of Copenhagen.
Vancouver
Baron R, Durieu J, Haller HH, Solal P. Finding a Nash Equilibrium in Spatial Games is an NP-Complete Problem. Department of Economics, University of Copenhagen. 2002.
Author
Bibtex
@techreport{fdcc68a074c611dbbee902004c4f4f50,
title = "Finding a Nash Equilibrium in Spatial Games is an NP-Complete Problem",
abstract = " ",
author = "Richard Baron and Jacques Durieu and Haller, {Hans Hermann} and Philippe Solal",
note = "JEL Classification: C72",
year = "2002",
language = "English",
publisher = "Department of Economics, University of Copenhagen",
address = "Denmark",
type = "WorkingPaper",
institution = "Department of Economics, University of Copenhagen",
}
RIS
TY - UNPB
T1 - Finding a Nash Equilibrium in Spatial Games is an NP-Complete Problem
AU - Baron, Richard
AU - Durieu, Jacques
AU - Haller, Hans Hermann
AU - Solal, Philippe
N1 - JEL Classification: C72
PY - 2002
Y1 - 2002
N2 -
AB -
M3 - Working paper
BT - Finding a Nash Equilibrium in Spatial Games is an NP-Complete Problem
PB - Department of Economics, University of Copenhagen
ER -
ID: 160525