On the order of eliminating dominated strategies

Itzhak Gilboa (1) , E. Kalai , E. Zemel

1 Northwestern University [Evanston]

It is known that different orders of eliminating dominated strategies in n-person games may yield different reduced games. One gives conditions which guarantee that the reduced game is unique. For finite games, the conditions include the well-known cases of strict dominance, and in a slightly weaker form, of regular dominance for zero sum and similar games

Keywords: Zero sum game; Dominance; Player strategy; Game theory; strategy domination

Domains: Economy and decision science

Itzhak Gilboa, E. Kalai, E. Zemel. On the order of eliminating dominated strategies. Operations Research Letters, 1990, Vol.9, n°2, pp. 85-89. ⟨10.1016/0167-6377(90)90046-8⟩. ⟨hal-00481648⟩