On the Complexity of Approximating a Nash Equilibrium

ACM Transactions on Algorithms- United States

doi 10.1145/2483699.2483703

Full Text

Abstract

Available in

Categories

Date

June 1, 2013

Authors

Constantinos Daskalakis

Publisher

Association for Computing Machinery (ACM)

Related search

Random Nash Equilibrium

Fixed Point Theory

Computational Mathematics

Applied Mathematics

English

Optimal Bound on the Combinatorial Complexity of Approximating Polytopes

English

Learning the Optimum as a Nash Equilibrium

Journal of Economic Dynamics and Control

Applied Mathematics

English

Nash Equilibrium in a Game of Calibration

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

English

A Model of Tacit Collusion: Nash-2 Equilibrium Concept

Static & Dynamic Game Theory: Foundations & Applications

English

Stability of the Cournot-Nash Equilibrium in Standard Oligopoly

Acta Physica Polonica A

English

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

English

Generalizations of the Nash Equilibrium Theorem in the KKM Theory

Fixed Point Theory and Applications

Applied Mathematics

English

On the Complexity of Computing an Equilibrium in Combinatorial Auctions

English