Computability and randomness of Nash equilibrium in infinite games

DOI10.1016/0304-4068(91)90001-AzbMath0745.90083MaRDI QIDQ1177225

Kislaya Prasad

Publication date: 26 June 1992

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

zbMATH Keywords

unsolvabilityNash equilibrium in pure strategies

Mathematics Subject Classification ID

Noncooperative games (91A10)

Related Items (3)

Towards finite-fold Diophantine representations ⋮ On the computability of Nash equilibria ⋮ The incompleteness of theories of games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite automata play the repeated prisoner's dilemma
• Social choice and computational complexity
• Incompleteness theorems for random reals
• Some undecidable determined games
• Register machine proof of the theorem on exponential diophantine representation of enumerable sets
• Finite Rationality and Interpersonal Complexity in Repeated Games
• Computationally Related Problems

This page was built for publication: Computability and randomness of Nash equilibrium in infinite games