On the order of eliminating dominated strategies - HEC Paris - École des hautes études commerciales de Paris Access content directly
Journal Articles Operations Research Letters Year : 1990

On the order of eliminating dominated strategies

Itzhak Gilboa
  • Function : Author
  • PersonId : 867909
E. Kalai
  • Function : Author
E. Zemel
  • Function : Author


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

Dates and versions

hal-00481648 , version 1 (07-05-2010)



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⟩


70 View
0 Download



Gmail Facebook Twitter LinkedIn More