Complexity of finding Pareto-efficient allocations of highest welfare (Q2030716)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7356150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of finding Pareto-efficient allocations of highest welfare |
scientific article; zbMATH DE number 7356150 |
Statements
Complexity of finding Pareto-efficient allocations of highest welfare (English)
0 references
7 June 2021
0 references
assignment
0 references
Pareto-efficiency
0 references
welfare-maximization
0 references
complexity
0 references
integer programming
0 references
0 references
0 references
0.7942345142364502
0 references
0.7855132818222046
0 references
0.7818860411643982
0 references
0.781571090221405
0 references
0.7798795104026794
0 references
