Pages that link to "Item:Q483106"
From MaRDI portal
The following pages link to The computational complexity of rationalizing Pareto optimal choice behavior (Q483106):
Displaying 9 items.
- A characterization of the \(n\)-agent Pareto dominance relation (Q284382) (← links)
- Implications of Pareto efficiency for two-agent (household) choice (Q553519) (← links)
- A behavioral choice model when computational ability matters (Q702813) (← links)
- The computational complexity of rationalizing behavior (Q972378) (← links)
- On the testable implications of collective choice theories (Q1587639) (← links)
- The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)
- (Q3730298) (← links)
- (Q4787687) (← links)