Descriptive complexity and revealed preference theory

DOI10.1016/J.MATHSOCSCI.2019.06.006zbMATH Open1426.91087OpenAlexW2955299717MaRDI QIDQ2334833FDOQ2334833

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

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

zbMATH Keywords

revealed preferencedescriptive complexity theorynormal form games

Mathematics Subject Classification ID

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

Cites Work

• The Nonparametric Approach to Demand Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Revealed Preference Theory
• The complexity of theorem-proving procedures
• Title not available (Why is that?)
• On the testable implications of collective choice theories
• General revealed preference theory
• The logical structure of mathematical physics
• Ramsey eliminability
• Equilibrium behavior in markets and games: Testable restrictions and identification.
• Testing strictly concave rationality
• Descriptive complexity: a logician's approach to computation.
• Revealed Preference Theory
• Title not available (Why is that?)

Cited In (3)

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

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)