Pages that link to "Item:Q3162519"

The following pages link to The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements (Q3162519):

Displaying 7 items.

• 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 differentiable path-following algorithm for computing perfect stationary points (Q2181604) (← links)
• A characterization of quasi-perfect equilibria (Q2195700) (← links)
• An extension of quantal response equilibrium and determination of perfect equilibrium (Q2212791) (← links)
• A differentiable homotopy method to compute perfect equilibria (Q2220655) (← links)
• The real computational complexity of minmax value and equilibrium refinements in multi-player games (Q5919609) (← links)