Pages that link to "Item:Q647483"
From MaRDI portal
The following pages link to On the complexity of iterated weak dominance in constant-sum games (Q647483):
Displaying 5 items.
- Complexity and monotonicity results for domination games (Q266262) (← links)
- The computational complexity of iterated elimination of dominated strategies (Q315527) (← links)
- Iterated weak dominance in strictly competitive games of perfect information. (Q1867561) (← links)
- Iterated strict dominance in general games (Q2462288) (← links)
- On iterated dominance, matrix elimination, and matched paths (Q3113741) (← links)