First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
type: Item
instance of: scholarly article
title: First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
zbMATH Open document ID: 1243.91004
author: Andrew Gilpin
author: Javier Peña
author: Tuomas Sandholm
published in: Mathematical Programming. Series A. Series B
publication date: 2012-06-26T00:00:00Z
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C52
zbMATH DE Number: 6050440
MaRDI profile type: Publication
full work available at URL: s10107-010-0430-2
OpenAlex ID: W2072651894
cites work: Potential function methods for approximately solving linear programming problems: theory and practice.
cites work: Q3844775
cites work: On convergence rates of subgradient optimization methods
cites work: Smoothing Techniques for Computing Nash Equilibria of Sequential Games
cites work: The complexity of two-person zero-sum games in extensive form
cites work: Applying Metric Regularity to Compute a Condition Measure of a Smoothing Algorithm for Matrix Games
cites work: Excessive Gap Technique in Nonsmooth Convex Minimization
cites work: Smooth minimization of non-smooth functions
cites work: Q3576736
cites work: Q5342882
cites work: Q4536701
cites work: Efficient computation of behavior strategies
cites work: Q5691079
cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
DOI: 10.1007/S10107-010-0430-2
description: scientific article; zbMATH DE number 6050440