Angelo Fanelli

Computing Better Approximate Pure Nash Equilibria in Payoff-maximization Potential Games

Potential games are a fundamental class of games in which pure Nash equilibria are guaranteed to exist, yet computing such equilibria is computationally intractable for several subclasses. This has led to extensive research on computing approximate pure Nash equilibria. In this paper, we study payoff-maximization poten...