Login / Signup

Inapproximability of pure nash equilibria.

Alexander SkopalikBerthold Vöcking
Published in: STOC (2008)
Keyphrases
  • pure nash equilibria
  • approximation algorithms
  • game theoretic
  • pure nash equilibrium
  • congestion games
  • nash equilibrium
  • np hard
  • autonomous agents
  • machine learning
  • worst case
  • decision problems