138 citations · 262 across the 11 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.GT2014★ 2 cited
The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form
Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen +1
We consider the task of computing an approximation of a trembling hand perfect equilibrium for an n-player game in strategic form, n >= 3. We show that this task is complete for th…
cs.GT2014★ 3 cited
The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game of perfect recall
Kousha Etessami
We study the complexity of computing or approximating refinements of Nash equilibrium for a given finite n-player extensive form game of perfect recall (EFGPR), where n >= 3. Our r…