Pages that link to "Item:Q972378"
From MaRDI portal
The following pages link to The computational complexity of rationalizing behavior (Q972378):
Displaying 20 items.
- Choice and individual welfare (Q449179) (← links)
- The computational complexity of rationalizing Pareto optimal choice behavior (Q483106) (← links)
- On the computational complexity of consumer decision rules (Q702464) (← links)
- A behavioral choice model when computational ability matters (Q702813) (← links)
- Rationality, computability, and complexity (Q920814) (← links)
- Learnability and rationality of choice. (Q1420879) (← links)
- Finite and infinite complexity in axioms of rational choice or Sen's characterization of preference-compatibility cannot be improved (Q1824522) (← links)
- Computable preference and utility (Q1961959) (← links)
- Revealed preference theory: an algorithmic outlook (Q1991199) (← links)
- Choice resolutions (Q2235096) (← links)
- Rational agents are the quickest (Q2254040) (← links)
- Descriptive complexity and revealed preference theory (Q2334833) (← links)
- Sequential rationalization of multivalued choice (Q2344373) (← links)
- Complexity results for the weak axiom of revealed preference for collective consumption models (Q2348008) (← links)
- Context dependent beliefs (Q2399678) (← links)
- The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
- Assent-maximizing social choice (Q2452261) (← links)
- The complexity of shelflisting (Q2633440) (← links)
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)
- (Q6176116) (← links)