Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the computability of Nash equilibria

From MaRDI portal
Publication:1391660
Jump to:navigation, search

DOI10.1016/S0165-1889(97)00011-0zbMath0901.90175MaRDI QIDQ1391660

Kislaya Prasad

Publication date: 22 July 1998

Published in: Journal of Economic Dynamics \& Control (Search for Journal in Brave)


zbMATH Keywords

game theoryNash equilibriumcomputability


Mathematics Subject Classification ID

Noncooperative games (91A10) Abstract computational complexity for mathematical programming problems (90C60)


Related Items (1)

Computability of simple games: A characterization and application to the core



Cites Work

  • Computability and randomness of Nash equilibrium in infinite games
  • Universal diophantine equation
  • A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: On the computability of Nash equilibria

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1391660&oldid=13545111"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki