The following pages link to (Q3245637):
Displayed 26 items.
- Modular Nim (Q673073) (← links)
- What can and cannot be done with Diophantine problems (Q741171) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Uncomputability and undecidability in economic theory (Q1036534) (← links)
- On effectively computable realizations of choice functions (Q1072545) (← links)
- Epidemiography. II: Games with a dozing yet winning player (Q1106113) (← links)
- Lower bounds on degrees of game-theoretic structures (Q1106754) (← links)
- Some undecidable determined games (Q1171511) (← links)
- Computability and randomness of Nash equilibrium in infinite games (Q1177225) (← links)
- Computational complexity of winning strategies in two-person polynomial games (Q1190954) (← links)
- On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making (Q1196206) (← links)
- Computability, complexity and economics (Q1318305) (← links)
- On the computability of Nash equilibria (Q1391660) (← links)
- Expository notes on computability and complexity in (arithmetical) games (Q1391661) (← links)
- Skolem functions of arithmetical sentences. (Q1427862) (← links)
- Recent results and questions in combinatorial game complexities (Q1583532) (← links)
- Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
- Computable presentability of countable linear orders (Q2036473) (← links)
- Non-computable rational expectations equilibria (Q2366196) (← links)
- The role of information processing cost as the foundation of bounded rationality in game theory (Q2442560) (← links)
- Peirce's contributions to possible-worlds semantics (Q2500776) (← links)
- Complexity of winning strategies (Q2554653) (← links)
- Max Euwe's Set-Theoretic Observations on the Game of Chess — Introductory Notes (Q4598040) (← links)
- The complexity of recursion theoretic games (Q5694972) (← links)
- From undecidability of non-triviality and finiteness to undecidability of learnability (Q6064265) (← links)
- Bounded rationality for relaxing best response and mutual consistency: the quantal hierarchy model of decision making (Q6185876) (← links)