The following pages link to Iterated elimination procedures (Q2205992):
Displaying 11 items.
- The computational complexity of iterated elimination of dominated strategies (Q315527) (← links)
- Iterative information update and stability of strategies (Q542135) (← links)
- Searching by elimination (Q920625) (← links)
- Iterative elimination of weakly dominated strategies in binary voting agendas with sequential voting (Q1024769) (← links)
- Order independence for iterated weak dominance (Q1357404) (← links)
- The equivalence of the Dekel-Fudenberg iterative procedure and weakly perfect rationalizability. (Q1571052) (← links)
- Learning by the process of elimination (Q1854541) (← links)
- Iterated dominance in quasisupermodular games with strict single crossing property. (Q1972586) (← links)
- Iterated weak dominance and subgame dominance (Q2571919) (← links)
- Iterated bounded dominance (Q6140028) (← links)
- Order independence for rationalizability (Q6148581) (← links)