Journal of Philosophical Logic 27 (6):553-568 (1998)
|Abstract||We first state a few previously obtained results that lead to general undecidability and incompleteness theorems in axiomatized theories that range from the theory of finite sets to classical elementary analysis. Out of those results we prove several incompleteness theorems for axiomatic versions of the theory of noncooperative games with Nash equilibria; in particular, we show the existence of finite games whose equilibria cannot be proven to be computable.|
|Keywords||Chaitin incompleteness noncooperative games Richardson's functor undecidability|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Walter Elberfeld (2000). An Analysis of Stability Sets in Pure Coordination Games. Theory and Decision 49 (3):235-248.
Joerg Oechssler, Josef Hofbauer & Frank Riedel, Brown-Von Neumann-Nash Dynamics: The Continuous Strategy Case.
Giovanni Facchini, Freek van Megen, Peter Borm & Stef Tijs (1997). Congestion Models and Weighted Bayesian Potential Games. Theory and Decision 42 (2):193-206.
Newton C. A. da Costa & Francisco A. Doria (1995). Undecidability, Incompleteness and Arnol'D Problems. Studia Logica 55 (1):23 - 32.
Alexander Matros, Existence of Mixed Strategy Equilibria in a Class of Discontinuous Games with Unbounded Strategy Sets.
Raymond M. Smullyan (1993). Recursion Theory for Metamathematics. Oxford University Press.
Added to index2009-01-28
Total downloads29 ( #48,084 of 722,874 )
Recent downloads (6 months)1 ( #60,917 of 722,874 )
How can I increase my downloads?