A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759)
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: A lower bound of \(1+\varphi \) for truthful scheduling mechanisms |
scientific article; zbMATH DE number 6163660
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound of \(1+\varphi \) for truthful scheduling mechanisms |
scientific article; zbMATH DE number 6163660 |
Statements
A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (English)
0 references
16 May 2013
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
