Pages that link to "Item:Q483106"

The following pages link to The computational complexity of rationalizing Pareto optimal choice behavior (Q483106):

Displaying 2 items.

• A characterization of the \(n\)-agent Pareto dominance relation (Q284382) (← links)
• Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)