On the order of eliminating dominated strategies
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
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||Mar 1990|
|Publication status:||Published in Operations Research Letters, Elsevier, 1990, Vol.9, n°2, pp. 85-89. <10.1016/0167-6377(90)90046-8>|
|Note:||View the original document on HAL open archive server: https://hal-hec.archives-ouvertes.fr/hal-00481648|
|Contact details of provider:|| Web page: https://hal.archives-ouvertes.fr/|