Computability of Nash equilibrium

zbMATH Open1129.91301MaRDI QIDQ3374478FDOQ3374478

Authors: Hidetoshi Tashiro 

Publication date: 9 March 2006

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

zbMATH Keywords

algorithm

Mathematics Subject Classification ID

Noncooperative games (91A10)

Cited In (9)

• Universal Computation in the Prisoner’s Dilemma Game
• Computability and randomness of Nash equilibrium in infinite games
• Title not available (Why is that?)
• The complexity of computing a Nash equilibrium
• Rationality, Computability, and Nash Equilibrium
• Title not available (Why is that?)
• How incomputable is finding Nash equilibria?
• Computing Cournot-Nash Equilibria
• Title not available (Why is that?)

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)