Descriptive complexity and revealed preference theory

DOI10.1016/J.MATHSOCSCI.2019.06.006MaRDI QIDQ2334833zbMATH OpenOpenAlexFDO

Authors Ádám Galambos

Publication date 8 November 2019

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

Full work available at URL https://doi.org/10.1016/j.mathsocsci.2019.06.006

zbMATH Keywords

revealed preferencedescriptive complexity theorynormal form games

Mathematics Subject Classification ID

Decision theory (91B06) Individual preferences (91B08) Applications of game theory (91A80)

Recommendations

• The computational complexity of rationalizing behavior
• Game theory via revealed preferences
• General revealed preference theory
• The computational complexity of rationalizing boundedly rational choice behavior
• Revealed preference theory: an algorithmic outlook

Cites work

• scientific article; zbMATH DE number 3761717 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1254648 (Why is no real title available?)
• scientific article; zbMATH DE number 3001285 (Why is no real title available?)
• Descriptive complexity: a logician's approach to computation.
• Equilibrium behavior in markets and games: Testable restrictions and identification.
• General revealed preference theory
• On the testable implications of collective choice theories
• Ramsey eliminability
• Revealed Preference Theory
• Revealed Preference Theory
• Testing strictly concave rationality
• The Nonparametric Approach to Demand Analysis
• The complexity of theorem-proving procedures
• The logical structure of mathematical physics

Cited in

(3)

• General revealed preference theory
• Game theory via revealed preferences
• Recent advances on testability in economic equilibrium models

This page was built for publication: Descriptive complexity and revealed preference theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334833)