First-order algorithm with O((1/)) convergence for -equilibrium in two-person zero-sum games
From MaRDI portal
Publication:431003
Recommendations
- Efficient search of first-order Nash equilibria in nonconvex-concave smooth min-max problems
- Smoothing techniques for computing Nash equilibria of sequential games
- Faster algorithms for extensive-form game solving via improved smoothing functions
- Near-optimal no-regret algorithms for zero-sum games
- scientific article; zbMATH DE number 18885
Cites work
- A course in game theory.
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Applying metric regularity to compute a condition measure of a smoothing algorithm for matrix games
- Efficient computation of behavior strategies
- Excessive Gap Technique in Nonsmooth Convex Minimization
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 1759693 (Why is no real title available?)
- scientific article; zbMATH DE number 3215746 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- On convergence rates of subgradient optimization methods
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Smooth minimization of non-smooth functions
- Smoothing techniques for computing Nash equilibria of sequential games
- The complexity of two-person zero-sum games in extensive form
Cited in
(23)- New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure
- Algorithm for computing approximate Nash equilibrium in continuous games with application to continuous blotto
- Faster algorithms for extensive-form game solving via improved smoothing functions
- Faster subgradient methods for functions with Hölderian growth
- A simple nearly optimal restart scheme for speeding up first-order methods
- Towards a deeper geometric, analytic and algorithmic understanding of margins
- On incremental approximate saddle-point computation in zero-sum matrix games
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
- Applying metric regularity to compute a condition measure of a smoothing algorithm for matrix games
- Smoothing techniques for computing Nash equilibria of sequential games
- Subgradient methods for huge-scale optimization problems
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity
- Forward-partial inverse-forward splitting for solving monotone inclusions
- Efficient search of first-order Nash equilibria in nonconvex-concave smooth min-max problems
- Sharpness, restart, and acceleration
- ``Efficient subgradient methods for general convex optimization
- A deterministic rescaled perceptron algorithm
- Faster first-order primal-dual methods for linear programming using restarts and sharpness
- Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming
- A decomposition approach on the base of Brownian iteration for the linear programming where all basis matrices are M-matrix
- A first order method for linear programming parameterized by circuit imbalance
- A first order method for linear programming parameterized by circuit imbalance
- Uncertain stochastic hybrid systems and zero-sum games: saddle-point solution and application to counterterrorism
This page was built for publication: First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q431003)
