The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases (Q1755782)
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 fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases |
scientific article; zbMATH DE number 7000180
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases |
scientific article; zbMATH DE number 7000180 |
Statements
The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases (English)
0 references
11 January 2019
0 references
assignment problem
0 references
fairness
0 references
ordered weighted average
0 references
complexity
0 references
0 references
0 references
