On the communication complexity of approximate Nash equilibria
type: Item
instance of: scholarly article
title: On the communication complexity of approximate Nash equilibria
title: On the Communication Complexity of Approximate Nash Equilibria
zbMATH Open document ID: 1290.91017
zbMATH Open document ID: 1284.91021
DOI: 10.1007/978-3-642-33996-7_17
DOI: 10.1016/J.GEB.2014.01.009
author: Paul W. Goldberg
author: Arnoud Pastink
published in: Games and Economic Behavior
published in: Algorithmic Game Theory
publication date: 2014-04-01T00:00:00Z
publication date: 2013-03-13T00:00:00Z
full work available at URL: https://arxiv.org/abs/1302.3793
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A28
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6276563
zbMATH DE Number: 6144479
zbMATH Keywords: two player
zbMATH Keywords: mixed strategy
zbMATH Keywords: approximate equilibria
zbMATH Keywords: efficient algorithms
MaRDI profile type: Publication
OpenAlex ID: W2059732663
OpenAlex ID: W1759912955
arXiv ID: 1302.3793
cites work: Settling the complexity of computing two-player Nash equilibria
cites work: Q3844775
cites work: The Complexity of Computing a Nash Equilibrium
cites work: A note on approximate Nash equilibria
cites work: On Learning Algorithms for Nash Equilibria
cites work: Approximate well-supported Nash equilibria below two-thirds
cites work: Calibrated learning and correlated equilibrium
cites work: Q3093345
cites work: On the approximation performance of fictitious play in finite games
cites work: How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
cites work: A Simple Adaptive Procedure Leading to Correlated Equilibrium
cites work: Stochastic uncoupled dynamics and Nash equilibrium
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: A new polynomial-time algorithm for linear programming
cites work: Well supported approximate equilibria in bimatrix games
cites work: Communication Complexity
cites work: Non-cooperative games
description: scientific article; zbMATH DE number 6144479
alternative label: On the Communication Complexity of Approximate Nash Equilibria