Sign in

Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses.

Spyros C. KontogiannisPaul G. Spirakis
Published in: APPROX-RANDOM (2010)
Keyphrases
  • nash equilibria
  • nash equilibrium
  • tractable subclasses
  • game theory
  • constraint satisfaction problems
  • incomplete information
  • global consistency
  • game theoretic
  • np complete
  • computer games
  • worst case