Login / Signup

On the robustness of the approximate price of anarchy in generalized congestion games.

Vittorio Bilò
Published in: Theor. Comput. Sci. (2022)
Keyphrases
  • congestion games
  • decision making
  • genetic algorithm
  • search algorithm
  • search space
  • mobile robot
  • exact and approximate
  • pure nash equilibria
  • pure nash equilibrium