Choice and complexity

DOI10.1016/0165-4896(87)90011-4zbMath0626.90002OpenAlexW2067964188MaRDI QIDQ581191

Hans W. Gottinger

Publication date: 1987

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-4896(87)90011-4

zbMATH Keywords

complexitycomputability theorycognitive sciencelimited rationalitysocial choice machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social choice (91B14)

Related Items (2)

Non-computable rational expectations equilibria ⋮ The computational difficulty of manipulating an election

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On effectively computable realizations of choice functions
• Finite automata play the repeated prisoner's dilemma
• The Empirical Implications of a Utility Tree
• Algorithmic Information Theory
• Recursive metric spaces
• Introduction to a Theory of the Internal Structure of Functional Relationships

This page was built for publication: Choice and complexity