Amanote Research

Amanote Research

    RegisterSign In

On the Complexity of Approximating a Nash Equilibrium

ACM Transactions on Algorithms - United States
doi 10.1145/2483699.2483703
Full Text
Open PDF
Abstract

Available in full text

Categories
Mathematics
Date

June 1, 2013

Authors
Constantinos Daskalakis
Publisher

Association for Computing Machinery (ACM)


Related search

Random Nash Equilibrium

Fixed Point Theory
Computational MathematicsApplied MathematicsAnalysis
2018English

Optimal Bound on the Combinatorial Complexity of Approximating Polytopes

2020English

Learning the Optimum as a Nash Equilibrium

Journal of Economic Dynamics and Control
ControlApplied MathematicsOptimizationEconometricsEconomics
2000English

Nash Equilibrium in a Game of Calibration

Теория вероятностей и ее применения
2006English

A Model of Tacit Collusion: Nash-2 Equilibrium Concept

Static & Dynamic Game Theory: Foundations & Applications
2016English

Approximating Nash Social Welfare Under Submodular Valuations Through (Un)Matchings

2020English

Generalizations of the Nash Equilibrium Theorem in the KKM Theory

Fixed Point Theory and Applications
GeometryApplied MathematicsTopology
2010English

Stability of the Cournot-Nash Equilibrium in Standard Oligopoly

Acta Physica Polonica A
AstronomyPhysics
2012English

Teaching Mixed Strategy Nash Equilibrium to Undergraduates

International Review of Economics Education
Education
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy