A new lower bound for deterministic truthful scheduling (Q5918586)

From MaRDI portal
Revision as of 10:11, 12 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7635682
Language Label Description Also known as
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
    0 references
    0 references
    0 references
    21 December 2022
    0 references
    mechanism design
    0 references
    scheduling unrelated machines
    0 references
    makespan minimization
    0 references
    truthfulness
    0 references

    Identifiers