scientific article; zbMATH DE number 3215746
From MaRDI portal
Publication:5342882
Cited in
(8)- Representations and solutions for game-theoretic problems
- Multi-agent influence diagrams for representing and solving games.
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
- Faster algorithms for extensive-form game solving via improved smoothing functions
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
- On the complexity of computing sparse equilibria and lower bounds for no-regret learning in games
- Efficient representations for team and imperfect-recall equilibrium computation
- New complexity results about Nash equilibria
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5342882)
