scientific article; zbMATH DE number 5942357

MaRDI QIDQ3089367zbMATH OpenFDO

Authors Paul W. Goldberg

Publication date 24 August 2011

Mathematics Subject Classification ID

Applications of graph theory (05C90) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Special types of economic equilibria (91B52) Combinatorial games (91A46)

Recommendations

• PPAD-complete approximate pure Nash equilibria in Lipschitz games
• On the computability of Nash equilibria
• The complexity of pure Nash equilibria
• On the complexity of Pareto-optimal Nash and strong equilibria
• On the complexity of Pareto-optimal Nash and strong equilibria
• Inapproximability of NP-complete variants of Nash equilibrium
• Inapproximability of NP-Complete Variants of Nash Equilibrium
• The Computational Complexity of Nash Equilibria in Concisely Represented Games
• The computation of approximate competitive equilibrium is PPAD-hard

Cited in

(4)

• On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
• On the Complexity of Equilibrium Computation in First-Price Auctions
• Discrete versions of the KKM lemma and their PPAD-completeness
• The complexity of computing a Nash equilibrium

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089367)