A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-012-9634-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1602132852 / rank | |||
Normal rank | |||
Revision as of 02:12, 20 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
