Pages that link to "Item:Q847801"
From MaRDI portal
The following pages link to Computing a quasi-perfect equilibrium of a two-player game (Q847801):
Displaying 11 items.
- On perfect Nash equilibria of polymatrix games (Q457873) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Efficient computation of equilibria for extensive two-person games (Q1815001) (← 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)
- A differentiable homotopy method to compute perfect equilibria (Q2220655) (← links)
- Fast algorithms for finding randomized strategies in game trees (Q2817671) (← links)
- An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information (Q2938479) (← links)
- The real computational complexity of minmax value and equilibrium refinements in multi-player games (Q5919609) (← links)
- A variant of the logistic quantal response equilibrium to select a perfect equilibrium (Q6582422) (← links)