This chapter discusses several classes of potential games that are common in the literature and how to derive the Nash equilibrium for such games. It first considers identical interests games and dummy games before turning to decoupled games and bilateral symmetric games. It then describes congestion games, in which all players are equal, in the sense that the cost associated with each resource only depends on the total number of players using that resource and not on which players use it. It also presents other potential games, including the Sudoku puzzle, and goes on to analyze the distributed resource allocation problem, the computation of Nash equilibria for potential games, and fictitious play. It concludes with practice exercises and their corresponding solutions, along with additional exercises.
Pure Nash Equilibrium in a Capacitated Selfish Resource Allocation Game
