4 papers
cs.GT2026
Variable Bound Tightening for Nash Equilibrium Computation in Multiplayer Imperfect-Information Games
Sam Ganzfried
There has been significant recent progress in algorithms for approximation of Nash equilibrium in large two-player zero-sum imperfect-information games and exact computation of Nas…
cs.GT2026
Evolutionarily Stable Stackelberg Equilibrium
Sam Ganzfried
We present a new solution concept called evolutionarily stable Stackelberg equilibrium (SESS). We study the Stackelberg evolutionary game setting in which there is a single leading…
cs.GT2025
Computing Evolutionarily Stable Strategies in Multiplayer Games
Sam Ganzfried
We present an algorithm for computing evolutionarily stable strategies in symmetric normal-form games with three or more players.
stat.ME2023
Nonparametric Strategy Test
Sam Ganzfried
We present a nonparametric statistical test for determining whether an agent is following a given mixed strategy in a repeated strategic-form game given samples of the agent's play…