The computational complexity of rationalizing Pareto optimal choice behavior (Q483106)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of rationalizing Pareto optimal choice behavior |
scientific article |
Statements
The computational complexity of rationalizing Pareto optimal choice behavior (English)
0 references
15 December 2014
0 references
Pareto efficiency
0 references
computational complexity
0 references
NP-complete
0 references
