The order independence of iterated dominance in extensive games
Shimoji and Watson (1998) prove that a strategy of an extensive game is rationalizable in the sense of Pearce if and only if it survives the maximal elimination of conditionally dominated strategies. Briefly, this process iteratively eliminates conditionally dominated strategies according to a speci...
Main Authors: | Chen, Jing, Micali, Silvio |
---|---|
Format: | Article |
Language: | en_US |
Published: |
John Wiley & Sons, Inc./© Jing Chen, & Silvio Micali
2022
|
Online Access: | https://doi.org/10.3982/TE942 https://hdl.handle.net/1721.1/141702 |
Similar Items
-
The order independence of iterated dominance in extensive games
by: Chen, Jing, et al.
Published: (2013) -
The Order Independence of Iterated Dominance in Extensive Games, with Connections to Mechanism Design and Backward Induction
by: Chen, Jing, et al.
Published: (2012) -
Collusive dominant-strategy truthfulness
by: Chen, Jing, et al.
Published: (2022) -
Collusive dominant-strategy truthfulness
by: Chen, Jing, et al.
Published: (2015) -
Dominance, sharing, and assessment in an iterated Hawk-Dove game
by: Hall, C, et al.
Published: (2019)