New algorithms for approximate Nash equilibria in bimatrix games
type: Item
instance of: scholarly article
title: New algorithms for approximate Nash equilibria in bimatrix games
zbMATH Open document ID: 1180.91020
author: Hartwig Bosse
author: Jaroslaw Byrka
author: Evangelos Markakis
published in: Theoretical Computer Science
publication date: 2009-12-01T00:00:00Z
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 91A06
zbMATH DE Number: 5641358
zbMATH Keywords: noncooperative games
zbMATH Keywords: approximate Nash equilibria
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.09.023
OpenAlex ID: W2072656810
cites work: On sparse approximations to randomized strategies and convex combinations
cites work: The complexity of computing a Nash equilibrium
cites work: A note on approximate Nash equilibria
cites work: On the Complexity of Nash Equilibria and Other Fixed Points
cites work: Reducibility among equilibrium problems
cites work: Polynomial algorithms for approximating Nash equilibria of bimatrix games
cites work: Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
cites work: Non-cooperative games
cites work: An Optimization Approach for Approximate Nash Equilibria
cites work: Approximate Equilibria for Strategic Two Person Games
DOI: 10.1016/J.TCS.2009.09.023
description: scientific article; zbMATH DE number 5641358