Computability, complexity and economics

Related Items (1)

The role of information processing cost as the foundation of bounded rationality in game theory

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
NP-completeness of some problems concerning voting games
Rationality, computability, and complexity
Finite automata play the repeated prisoner's dilemma
Objective functions and the complexity of policy design
The complexity of computing best-response automata in repeated games
On the control of structural models
Some undecidable determined games
On players with a bounded number of states
Repeated games, finite automata, and complexity
The complexity of computing a best response automaton in repeated games with mixed strategies
Informational requirements and strategic complexity in repeated games
The complexity of dynamic programming
Risk, uncertainty, and complexity
Small talk and cooperation: A note on bounded rationality
Finite and infinite complexity in axioms of rational choice or Sen's characterization of preference-compatibility cannot be improved
Learning Rational Expectations Under Computability Constraints
A Theory of Monetary Exchange
Finite Rationality and Interpersonal Complexity in Repeated Games
Controlling a Stochastic Process with Unknown Parameters
The Structure of Nash Equilibrium in Repeated Games with Finite Automata
Rationality, Computability, and Nash Equilibrium
Money and the Decentralization of Exchange
Linear Quadratic Control Theory for Models with Long Lags
A Machine-Independent Theory of the Complexity of Recursive Functions

This page was built for publication: Computability, complexity and economics