The computational complexity of rationalizing Pareto optimal choice behavior (Q483106)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The computational complexity of rationalizing Pareto optimal choice behavior |
scientific article; zbMATH DE number 6380716
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of rationalizing Pareto optimal choice behavior |
scientific article; zbMATH DE number 6380716 |
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
