Login / Signup
Computing 1/3-approximate Nash equilibria of bimatrix games in polynomial time..
Paul G. Spirakis
Haralampos Tsaknakis
Published in:
Electron. Colloquium Comput. Complex. (2007)
Keyphrases
</>
nash equilibria
game theory
congestion games
incomplete information
nash equilibrium
stochastic games
fictitious play
game theoretic
pure strategy
solution concepts
worst case
special case
multi agent systems
expert systems
approximation algorithms
genetic algorithm
mixed strategy
cooperative