A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:20, 5 March 2024
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
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
