Faster algorithms for extensive-form game solving via improved smoothing functions
From MaRDI portal
Publication:2288198
DOI10.1007/s10107-018-1336-7zbMath1433.91014OpenAlexW2895703110MaRDI QIDQ2288198
Christian Kroer, Kevin Waugh, Fatma Kılınç-Karzan, Tuomas W. Sandholm
Publication date: 17 January 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-018-1336-7
Convex programming (90C25) 2-person games (91A05) Games in extensive form (91A18) Algorithmic game theory and complexity (91A68)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- Smooth minimization of non-smooth functions
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
- Efficient computation of behavior strategies
- Efficient computation of equilibria for extensive two-person games
- Faster algorithms for extensive-form game solving via improved smoothing functions
- Near-optimal no-regret algorithms for zero-sum games
- An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information
- Smoothing Techniques for Computing Nash Equilibria of Sequential Games
- Lossless abstraction of imperfect information games
- DeepStack: Expert-level artificial intelligence in heads-up no-limit poker
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Solving variational inequalities with Stochastic Mirror-Prox algorithm
- The Complexity of Computing a Nash Equilibrium
- Excessive Gap Technique in Nonsmooth Convex Minimization
This page was built for publication: Faster algorithms for extensive-form game solving via improved smoothing functions
