The computational complexity of rationalizing behavior
type: Item
instance of: scholarly article
title: The computational complexity of rationalizing behavior
zbMATH Open document ID: 1229.91099
author: Jose Apesteguia
author: Miguel A. Ballester
published in: Journal of Mathematical Economics
publication date: 2010-05-25T00:00:00Z
Mathematics Subject Classification ID: 91B06
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5711897
zbMATH Keywords: rationalization
zbMATH Keywords: computational complexity
zbMATH Keywords: NP-complete
zbMATH Keywords: arbitrary choice domains
MaRDI profile type: Publication
full work available at URL: j.jmateco.2010.02.001
OpenAlex ID: W2148444551
cites work: Choice by sequential procedures
cites work: NP-completeness in hedonic games
cites work: Realization of Choice Functions
cites work: Rationality from a computational standpoint
cites work: Introduction to algorithms
cites work: The complexity of economic decision rules
cites work: Q4198056
cites work: Information, associativity, and choice requirements
cites work: Ideal structures of path independent choice functions
cites work: Locally complete path independent choice functions and their lattices
cites work: Rationalizing Choice Functions By Multiple Rationales
cites work: Q4142699
cites work: Choice functions and abstract convex geometries
cites work: Rational agents are the quickest
cites work: A million answers to twenty questions: choosing by checklist
cites work: Context-Dependent Preferences
DOI: 10.1016/J.JMATECO.2010.02.001
description: scientific article; zbMATH DE number 5711897