Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > STRATEGIC GAMES:
Reports tagged with Strategic games:
TR05-031 | 1st March 2005
Carme Alvarez, Joaquim Gabarro, Maria Serna

Pure Nash equilibria in games with a large number of actions

We study the computational complexity of deciding the existence of a
Pure Nash Equilibrium in multi-player strategic games.
We address two fundamental questions: how can we represent a game?, and
how can we represent a game with polynomial pay-off functions?
Our results show that the computational complexity of
deciding ... more >>>




ISSN 1433-8092 | Imprint