![](https://d3ilqtpdwi981i.cloudfront.net/NRx3S4pWKJXA1CjO_2c1RBcIODE=/425x550/smart/https://bepress-attached-resources.s3.amazonaws.com/uploads/7b/56/99/7b569921-102c-4025-8624-5da253c87721/thumbnail_58727b0c-8683-471f-8d19-8e5b633eb6b0.jpg)
We introduce a weakening of standard gametheoretic δ-dominance conditions, called dominance, which enables more aggressive pruning of candidate strategies at the cost of solution accuracy. Equilibria of a game obtained by eliminating a δ-dominated strategy are guaranteed to be approximate equilibria of the original game, with degree of approximation bounded by the dominance parameter. We can apply elimination of δ-dominated strategies iteratively, but the for which a strategy may be eliminated depends on prior eliminations. We discuss implications of this order independence, and propose greedy heuristics for determining a sequence of eliminations to reduce the game as far as possible while keeping down costs. A case study analysis of an empirical 2-player game serves to illustrate the technique, and demonstrate the utility of weaker-than-weak dominance pruning.
Available at: http://works.bepress.com/sfcheng/14/