Faster algorithms for extensive-form game solving via improved smoothing functions
DOI10.1007/S10107-018-1336-7zbMATH Open1433.91014OpenAlexW2895703110MaRDI QIDQ2288198FDOQ2288198
Authors: Christian Kroer, Kevin Waugh, Fatma Kılınç-Karzan, Tuomas 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
Recommendations
- Faster algorithms for mean-payoff games
- Faster algorithm for mean-payoff games
- Faster algorithms for mean-payoff parity games
- Smoothing techniques for computing Nash equilibria of sequential games
- scientific article; zbMATH DE number 177098
- Efficient computation of equilibria for extensive two-person games
- Exact algorithms for solving stochastic games
- Faster Algorithms for Finitary Games
- Stochastic mean payoff games: smoothed analysis and approximation schemes
Convex programming (90C25) 2-person games (91A05) Games in extensive form (91A18) Algorithmic game theory and complexity (91A68)
Cites Work
- Lossless abstraction of imperfect information games
- Smooth minimization of non-smooth functions
- Primal-dual subgradient methods for convex problems
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Excessive Gap Technique in Nonsmooth Convex Minimization
- Title not available (Why is that?)
- The complexity of computing a Nash equilibrium
- Solving variational inequalities with stochastic mirror-prox algorithm
- Efficient computation of equilibria for extensive two-person games
- An exact double-oracle algorithm for zero-sum extensive-form games with imperfect information
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
- Efficient computation of behavior strategies
- Smoothing techniques for computing Nash equilibria of sequential games
- Title not available (Why is that?)
- Title not available (Why is that?)
- DeepStack: expert-level artificial intelligence in heads-up no-limit poker
- Faster algorithms for extensive-form game solving via improved smoothing functions
- Near-optimal no-regret algorithms for zero-sum games
Cited In (7)
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
- Revisiting CFR\(^+\) and alternating updates
- HSVI can solve zero-sum partially observable stochastic games
- An exact double-oracle algorithm for zero-sum extensive-form games with imperfect information
- Smoothing techniques for computing Nash equilibria of sequential games
- Faster algorithms for extensive-form game solving via improved smoothing functions
- Automatically designing counterfactual regret minimization algorithms for solving imperfect-information games
Uses Software
This page was built for publication: Faster algorithms for extensive-form game solving via improved smoothing functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288198)
