Pages that link to "Item:Q911490"

The following pages link to On the order of eliminating dominated strategies (Q911490):

Displaying 21 items.

• The computational complexity of iterated elimination of dominated strategies (Q315527) (← links)
• Cournot tâtonnement and dominance solvability in finite games (Q423893) (← links)
• Iterative information update and stability of strategies (Q542135) (← links)
• Lexicographic rationalizability and iterated admissibility (Q674075) (← links)
• Comparing the notions of optimality in CP-nets, strategic games and soft constraints (Q1029586) (← links)
• A note on strategy elimination in bimatrix games (Q1102210) (← links)
• Responsive and strong responsive evolutionary dynamics (Q1327068) (← links)
• Order independence for iterated weak dominance (Q1357404) (← links)
• Chess-like games are dominance solvable in at most two steps (Q1593744) (← links)
• Game theory with translucent players (Q1621735) (← links)
• Rationalizability and logical inference (Q1651238) (← links)
• Dominant strategy implementability and zero length cycles (Q2074053) (← links)
• Iterated elimination procedures (Q2205992) (← links)
• Dominance rationality: a unified approach (Q2291170) (← links)
• Iterated strict dominance in general games (Q2462288) (← links)
• The Complexity of Eliminating Dominated Strategies (Q3140533) (← links)
• (Q3719380) (← links)
• Elimination of dominated strategies and inessential players (Q4682531) (← links)
• COALITION-PROOF NASH EQUILIBRIA IN A NORMAL-FORM GAME AND ITS SUBGAMES (Q5392795) (← links)
• Iterated bounded dominance (Q6140028) (← links)
• Order independence for rationalizability (Q6148581) (← links)