A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759)

From MaRDI portal
Revision as of 17:06, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A lower bound of \(1+\varphi \) for truthful scheduling mechanisms
scientific article

    Statements

    A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (English)
    0 references
    0 references
    0 references
    0 references
    16 May 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithmic game theory
    0 references
    mechanism design
    0 references
    scheduling unrelated machines
    0 references
    truthful
    0 references
    lower bound
    0 references
    dominant strategies
    0 references
    multiparameter mechanism design
    0 references