7 citations · 12 across the 5 of their papers we have counts for
8 papers
Computational Complexity of Computing a Quasi-Proper Equilibrium
Kristoffer Arnsfelt Hansen, Troels Bjerre Lund
We study the computational complexity of computing or approximating a quasi-proper equilibrium for a given finite extensive form game of perfect recall. We show that the task of co…
Computation of Stackelberg Equilibria of Finite Sequential Games
Branislav Bosansky, Simina Branzei, Kristoffer Arnsfelt Hansen +2
The Stackelberg equilibrium solution concept describes optimal strategies to commit to: Player 1 (termed the leader) publicly commits to a strategy and Player 2 (termed the followe…
Timeability of Extensive-Form Games
Sune K. Jakobsen, Troels B. Sørensen, Vincent Conitzer
Extensive-form games constitute the standard representation scheme for games with a temporal component. But do all extensive-form games correspond to protocols that we can implemen…
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…
Path coalitional games
Haris Aziz, Troels Bjerre Sørensen
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these…
On the Approximation Performance of Fictitious Play in Finite Games
Paul W. Goldberg, Rahul Savani, Troels Bjerre Sorensen +1
We study the performance of Fictitious Play, when used as a heuristic for finding an approximate Nash equilibrium of a 2-player game. We exhibit a class of 2-player games having pa…