scientific article; zbMATH DE number 1842054

MaRDI QIDQ4783573zbMATH OpenFDO

Authors Hidetoshi Tashiro

Publication date 4 December 2002

zbMATH Keywords

algorithmNash equilibriumcomputability

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05)

Recommendations

• Computability of Nash equilibrium
• Rationality, Computability, and Nash Equilibrium
• Computability and randomness of Nash equilibrium in infinite games
• The complexity of computing a Nash equilibrium
• The complexity of computing a Nash equilibrium

Cited in

(12)

• Computability of Nash equilibrium
• Universal Computation in the Prisoner’s Dilemma Game
• Computability and randomness of Nash equilibrium in infinite games
• scientific article; zbMATH DE number 6612107 (Why is no real title available?)
• The complexity of computing a Nash equilibrium
• Cooperation and computability in \(n\)-player games
• Rationality, Computability, and Nash Equilibrium
• Computability of simple games: A characterization and application to the core
• On the existence of Nash equilibrium in games with resource-bounded players
• Computing Cournot-Nash Equilibria
• scientific article; zbMATH DE number 7136658 (Why is no real title available?)
• The return function: a new computable perspective on Bayesian-Nash equilibria

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 Q4783573)