Pages that link to "Item:Q2638309"
From MaRDI portal
The following pages link to On the complexity of testing the collective axiom of revealed preference (Q2638309):
Displayed 5 items.
- The computational complexity of rationalizing Pareto optimal choice behavior (Q483106) (← links)
- Revealed preference theory: an algorithmic outlook (Q1991199) (← links)
- Complexity results for the weak axiom of revealed preference for collective consumption models (Q2348008) (← links)
- Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles (Q2815462) (← links)
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)