The complexity of eliminating dominated strategies

Itzhak Gilboa (1) , Ehud Kalai (1) , Eitan Zemel (1)

1 Northwestern University [Evanston]

This paper deals with the computational complexity of some yes /no problems associated with sequential elimination of strategies using three domination relations: strong domination (strict inequalities), weak domination (weak inequalities), and domination (the asymmetric part of weak domination). Classification of various problems as polynomial or NP-complete seems to suggest that strong domination is a simple notion, whereas weak domination and domination are complicated ones.

Mots clés: Game theory; Player strategy; Computability; Polynomial time; NP complete problem

Domaines: Economie et sciences de la décision

Itzhak Gilboa, Ehud Kalai, Eitan Zemel. The complexity of eliminating dominated strategies. Mathematics of Operations Research, 1993, Vol.18, n°3, pp. 553-565. ⟨10.1287/moor.18.3.553⟩. ⟨hal-00481372⟩