3 problems

An FPTAS for computing Nash equilibria in $k$-strategy anonymous games is an algorithm running in time polynomial in the input size and $1/\epsilon$ that returns an $\epsilon$-appr…

An $n$-player anonymous game has a fixed number $k=O(1)$ of strategies, and an $\boldsymbol{\epsilon}$-Nash equilibrium is an equilibrium in which no player can gain more than…

An anonymous game is a game in which all players have the same strategy set and a player's payoff is unchanged when two other players exchange their strategies. Let $L(n,m,\delta)$…