Polynomial algorithms for approximating Nash equilibria of bimatrix games
type: Item
instance of: scholarly article
title: Polynomial algorithms for approximating Nash equilibria of bimatrix games
zbMATH Open document ID: 1159.91307
author: Spyros Kontogiannis
author: Panagiota N. Panagopoulou
author: P. G. Spirakis
published in: Theoretical Computer Science
publication date: 2009-04-29T00:00:00Z
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91-08
zbMATH DE Number: 5549385
zbMATH Keywords: bimatrix game
zbMATH Keywords: approximate Nash equilibrium
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.12.033
OpenAlex ID: W2158702668
cites work: On sparse approximations to randomized strategies and convex combinations
cites work: New algorithms for approximate Nash equilibria in bimatrix games
cites work: The complexity of computing a Nash equilibrium
cites work: A note on approximate Nash equilibria
cites work: Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
cites work: Bimatrix Equilibrium Points and Mathematical Programming
cites work: Equilibrium Points of Bimatrix Games
cites work: Non-cooperative games
cites work: On the complexity of the parity argument and other inefficient proofs of existence
DOI: 10.1016/J.TCS.2008.12.033
description: scientific article; zbMATH DE number 5549385