Computability of Nash equilibrium

zbMATH Open1129.91301MaRDI QIDQ3374478FDOQ3374478

Hidetoshi Tashiro

Publication date: 9 March 2006

zbMATH Keywords

algorithm

Mathematics Subject Classification ID

Noncooperative games (91A10)

Cited In (8)

• 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?)
• Computing Cournot-Nash Equilibria
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)