A new lower bound for deterministic truthful scheduling (Q5918586)
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 7635682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new lower bound for deterministic truthful scheduling |
scientific article; zbMATH DE number 7635682 |
Statements
A new lower bound for deterministic truthful scheduling (English)
0 references
21 December 2022
0 references
mechanism design
0 references
scheduling unrelated machines
0 references
makespan minimization
0 references
truthfulness
0 references
0.999755859375
0 references
0.932958483695984
0 references
0.9146156907081604
0 references
0.8805138468742371
0 references
