The incompleteness of theories of games (Q1277328)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The incompleteness of theories of games |
scientific article; zbMATH DE number 1248201
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The incompleteness of theories of games |
scientific article; zbMATH DE number 1248201 |
Statements
The incompleteness of theories of games (English)
0 references
22 April 1999
0 references
First, a few previously obtained results are stated dealing with general undecidability and incompleteness in axiomatized theories that range from the theory of finite sets to classical elementary analysis. Out of these results, several incompleteness theorems are proved for the theory of noncooperative games; in particular, it is shown tha there exist finite games whose Nash equilibria cannot be proven to be computable.
0 references
undecidability
0 references
incompleteness
0 references
axiomatized theories
0 references
noncooperative games
0 references
finite games
0 references
Nash equilibria
0 references
0 references
