Pages that link to "Item:Q1804643"

The following pages link to Two examples of strategic equilibrium (Q1804643):

Displaying 8 items.

• Computing a quasi-perfect equilibrium of a two-player game (Q847801) (← links)
• The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464) (← links)
• Computational complexity of computing a quasi-proper equilibrium (Q2140505) (← links)
• A characterization of quasi-perfect equilibria (Q2195700) (← links)
• On the topology of the set of Nash equilibria (Q2278904) (← links)
• On the equivalence between (quasi-)perfect and sequential equilibria (Q2453494) (← links)
• The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements (Q3162519) (← links)
• The real computational complexity of minmax value and equilibrium refinements in multi-player games (Q5919609) (← links)