101 citations · 491 across the 53 of their papers we have counts for
1 paper · 2 filters
Arno Pauly
We consider the computational complexity of the question whether a certain strategy can be removed from a game by means of iterated elimination of dominated strategies. In particul…