Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games.

Raffaello Carosi Michele Flammini Gianpiero Monaco

Published in: AAMAS (2017)

Keyphrases

pure nash equilibria
game theoretic
pure nash equilibrium
congestion games
nash equilibrium
efficient computation
computational complexity
game theory
video games