A note on approximate Nash equilibria
From MaRDI portal
Publication:1014628
DOI10.1016/j.tcs.2008.12.031zbMath1167.91390OpenAlexW2075425349MaRDI QIDQ1014628
Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou
Publication date: 29 April 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.031
Related Items (35)
A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium ⋮ Computing approximate Nash equilibria in general network revenue management games ⋮ Approximating Nash Equilibria in Tree Polymatrix Games ⋮ Approximate well-supported Nash equilibria below two-thirds ⋮ A Glimpse at Paul G. Spirakis ⋮ An algorithm for finding approximate Nash equilibria in bimatrix games ⋮ Domination in 3-tournaments ⋮ Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem ⋮ On the approximation performance of fictitious play in finite games ⋮ On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium ⋮ A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games ⋮ A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games ⋮ Evolution of Mixed Strategies in Monotone Games ⋮ Distributed Methods for Computing Approximate Equilibria ⋮ Inapproximability Results for Approximate Nash Equilibria ⋮ On the performance of approximate equilibria in congestion games ⋮ Parameterized two-player Nash equilibrium ⋮ On the communication complexity of approximate Nash equilibria ⋮ Recent development in computational complexity characterization of Nash equilibrium ⋮ Nash equilibria: complexity, symmetries, and approximation ⋮ Distributed methods for computing approximate equilibria ⋮ Computing approximate Nash equilibria in polymatrix games ⋮ Lipschitz continuity and approximate equilibria ⋮ Well supported approximate equilibria in bimatrix games ⋮ Inapproximability results for constrained approximate Nash equilibria ⋮ Approximate Nash Equilibria for Multi-player Games ⋮ A note on approximate Nash equilibria ⋮ Polynomial algorithms for approximating Nash equilibria of bimatrix games ⋮ Inapproximability of NP-Complete Variants of Nash Equilibrium ⋮ Lipschitz Continuity and Approximate Equilibria ⋮ Incentive-Compatible Learning of Reserve Prices for Repeated Auctions ⋮ New algorithms for approximate Nash equilibria in bimatrix games ⋮ Convergence method, properties and computational complexity for Lyapunov games ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Games of fixed rank: a hierarchy of bimatrix games
- A note on approximate Nash equilibria
- Polynomial algorithms for approximating Nash equilibria of bimatrix games
- New algorithms for approximate Nash equilibria in bimatrix games
- On sparse approximations to randomized strategies and convex combinations
- Simple strategies for large zero-sum games with applications to complexity theory
- Reducibility among equilibrium problems
- The complexity of computing a Nash equilibrium
- Settling the complexity of computing two-player Nash equilibria
- An Optimization Approach for Approximate Nash Equilibria
- On oblivious PTAS's for nash equilibrium
- Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
- The Approximation of Fixed Points of a Continuous Mapping
This page was built for publication: A note on approximate Nash equilibria
