The price of fairness for a two-agent scheduling game minimizing total completion time (Q2082220)
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 price of fairness for a two-agent scheduling game minimizing total completion time |
scientific article; zbMATH DE number 7595935
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The price of fairness for a two-agent scheduling game minimizing total completion time |
scientific article; zbMATH DE number 7595935 |
Statements
The price of fairness for a two-agent scheduling game minimizing total completion time (English)
0 references
4 October 2022
0 references
price of fairness
0 references
scheduling problem
0 references
KS-fair
0 references
0.8839239478111267
0 references
0.8166562914848328
0 references
0.8155756592750549
0 references
0.8139240741729736
0 references