Computability of Nash equilibrium

MaRDI QIDQ3374478zbMATH OpenFDO

Authors Hidetoshi Tashiro

Publication date 9 March 2006

zbMATH Keywords

algorithm

Mathematics Subject Classification ID

Noncooperative games (91A10)

Recommendations

• scientific article; zbMATH DE number 1842054
• Computability and randomness of Nash equilibrium in infinite games
• Rationality, Computability, and Nash Equilibrium
• The complexity of computing a Nash equilibrium
• The complexity of computing a Nash equilibrium

Cited in

(12)

• Computability and randomness of Nash equilibrium in infinite games
• On the computability of Nash equilibria
• On the existence of Nash equilibrium in games with resource-bounded players
• The complexity of computing a Nash equilibrium
• Universal Computation in the Prisoner’s Dilemma Game
• scientific article; zbMATH DE number 6612107 (Why is no real title available?)
• How incomputable is finding Nash equilibria?
• Computing Cournot-Nash Equilibria
• Rationality, Computability, and Nash Equilibrium
• scientific article; zbMATH DE number 1377704 (Why is no real title available?)
• scientific article; zbMATH DE number 1842054 (Why is no real title available?)
• scientific article; zbMATH DE number 7136658 (Why is no real title available?)

This page was built for publication: Computability of Nash equilibrium

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