Pages that link to "Item:Q2427841"
From MaRDI portal
The following pages link to The computational complexity of rationalizing boundedly rational choice behavior (Q2427841):
Displaying 16 items.
- BRA: an algorithm for simulating bounded rational agents (Q429817) (← links)
- The computational complexity of rationalizing Pareto optimal choice behavior (Q483106) (← links)
- A behavioral choice model when computational ability matters (Q702813) (← links)
- The computational complexity of rationalizing behavior (Q972378) (← links)
- Bounded rationality and search over small-world models (Q1344256) (← links)
- Rational analysis, intractability, and the prospects of `as if'-explanations (Q1709129) (← links)
- Boundedly rational search with positive search costs (Q1787626) (← links)
- The sequential choice model: a rationality analysis (Q1881831) (← links)
- Minimal rationalizations (Q2143882) (← 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)
- Sources of complexity in subset choice (Q2483826) (← links)
- (Q3730298) (← links)
- Rationalization of indecisive choice behavior by pluralist ballots (Q6146433) (← links)
- (Q6176116) (← links)