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 5 items.
- The computational complexity of rationalizing Pareto optimal choice behavior (Q483106) (← links)
- Minimal rationalizations (Q2143882) (← links)
- Sequential rationalization of multivalued choice (Q2344373) (← links)
- Complexity results for the weak axiom of revealed preference for collective consumption models (Q2348008) (← links)
- Rationalization of indecisive choice behavior by pluralist ballots (Q6146433) (← links)
