Pages that link to "Item:Q5474976"

The following pages link to Computing Normal Form Perfect Equilibria for Extensive Two-Person Games (Q5474976):

Displaying 19 items.

• Games of fixed rank: a hierarchy of bimatrix games (Q847799) (← links)
• Computing a quasi-perfect equilibrium of a two-player game (Q847801) (← links)
• Homotopy methods to compute equilibria in game theory (Q847802) (← links)
• Equilibrium tracing in strategic-form games (Q847803) (← links)
• New complexity results about Nash equilibria (Q932810) (← links)
• Finding all equilibria in games of strategic complements (Q996391) (← links)
• Efficient computation of multiple solutions in quasibrittle fracture analysis (Q1402568) (← links)
• The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464) (← links)
• A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications (Q2076884) (← links)
• Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria (Q2115252) (← links)
• Computational complexity of computing a quasi-proper equilibrium (Q2140505) (← links)
• A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games (Q2155890) (← links)
• An extension of quantal response equilibrium and determination of perfect equilibrium (Q2212791) (← links)
• A differentiable homotopy method to compute perfect equilibria (Q2220655) (← links)
• Behavioural strategies in weighted Boolean games (Q2225600) (← links)
• A note on bimatrix game maximal Selten subsets (Q2254918) (← links)
• Game Theory Explorer: software for the applied game theorist (Q2356171) (← links)
• Geometrie und Kombinatorik von Nash-Gleichgewichten. (Q2491987) (← links)
• Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)