On the computability of Nash equilibria

DOI10.1016/S0165-1889(97)00011-0MaRDI QIDQ1391660zbMATH OpenFDO

Authors Kislaya Prasad

Publication date 22 July 1998

Published in Journal of Economic Dynamics and Control (Search for Journal in Brave)

zbMATH Keywords

game theoryNash equilibriumcomputability

Mathematics Subject Classification ID

Noncooperative games (91A10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Undecidability of the existence of pure Nash equilibria
• Computability and randomness of Nash equilibrium in infinite games
• scientific article; zbMATH DE number 1842054
• Computability of Nash equilibrium
• The complexity of computing a Nash equilibrium

Cites work

• scientific article; zbMATH DE number 3128730 (Why is no real title available?)
• scientific article; zbMATH DE number 3827534 (Why is no real title available?)
• scientific article; zbMATH DE number 4030987 (Why is no real title available?)
• scientific article; zbMATH DE number 18247 (Why is no real title available?)
• scientific article; zbMATH DE number 545277 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
• Computability and randomness of Nash equilibrium in infinite games
• Universal diophantine equation

Cited in

(12)

• scientific article; zbMATH DE number 6612107 (Why is no real title available?)
• Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
• The complexity of computing a Nash equilibrium
• The Computational Complexity of Nash Equilibria in Concisely Represented Games
• scientific article; zbMATH DE number 5942357 (Why is no real title available?)
• Computing Cournot-Nash Equilibria
• Computability of simple games: A characterization and application to the core
• Computability and randomness of Nash equilibrium in infinite games
• On Structure and Computation of Generalized Nash Equilibria
• An undecidable statement regarding zero-sum games
• scientific article; zbMATH DE number 5722763 (Why is no real title available?)
• Universal Computation in the Prisoner’s Dilemma Game

This page was built for publication: On the computability of Nash equilibria

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