The following pages link to (Q5342882):
Displaying 6 items.
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games (Q431003) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Representations and solutions for game-theoretic problems (Q1391352) (← links)
- Multi-agent influence diagrams for representing and solving games. (Q1413219) (← links)
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464) (← links)
- Faster algorithms for extensive-form game solving via improved smoothing functions (Q2288198) (← links)
