scientific article
From MaRDI portal
Publication:3245637
zbMath0078.32902MaRDI QIDQ3245637
Publication date: 1957
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
Non-computable rational expectations equilibria ⋮ Complexity, appeal and challenges of combinatorial games ⋮ Computing equilibria: a computational complexity perspective ⋮ Epidemiography. II: Games with a dozing yet winning player ⋮ Lower bounds on degrees of game-theoretic structures ⋮ On the computability of Nash equilibria ⋮ Expository notes on computability and complexity in (arithmetical) games ⋮ From undecidability of non-triviality and finiteness to undecidability of learnability ⋮ Max Euwe's Set-Theoretic Observations on the Game of Chess — Introductory Notes ⋮ Bounded rationality for relaxing best response and mutual consistency: the quantal hierarchy model of decision making ⋮ The role of information processing cost as the foundation of bounded rationality in game theory ⋮ Skolem functions of arithmetical sentences. ⋮ Some undecidable determined games ⋮ The complexity of recursion theoretic games ⋮ Computability and randomness of Nash equilibrium in infinite games ⋮ Modular Nim ⋮ Computational complexity of winning strategies in two-person polynomial games ⋮ On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making ⋮ Peirce's contributions to possible-worlds semantics ⋮ Computable presentability of countable linear orders ⋮ What can and cannot be done with Diophantine problems ⋮ Complexity of winning strategies ⋮ Uncomputability and undecidability in economic theory ⋮ Recent results and questions in combinatorial game complexities ⋮ Computability, complexity and economics ⋮ On effectively computable realizations of choice functions
This page was built for publication:
