Smoothing Techniques for Computing Nash Equilibria of Sequential Games
From MaRDI portal
Publication:3169104
DOI10.1287/moor.1100.0452zbMath1232.91042OpenAlexW1980392196MaRDI QIDQ3169104
Samid Hoda, Tuomas W. Sandholm, Andrew Gilpin, Javier F. Peña
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1100.0452
2-person games (91A05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Multistage and repeated games (91A20)
Related Items (11)
Accelerated gradient sliding for structured convex optimization ⋮ Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem ⋮ Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability ⋮ Fast convergence of optimistic gradient ascent in network zero-sum extensive form games ⋮ First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games ⋮ Approximating maxmin strategies in imperfect recall games using A-loss recall property ⋮ Limited lookahead in imperfect-information games ⋮ Faster algorithms for extensive-form game solving via improved smoothing functions ⋮ Near-optimal no-regret algorithms for zero-sum games ⋮ Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games ⋮ Portfolio Selection with Multiple Spectral Risk Constraints
Uses Software
This page was built for publication: Smoothing Techniques for Computing Nash Equilibria of Sequential Games
