New bounds for truthful scheduling on two unrelated selfish machines (Q2300622)
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: New bounds for truthful scheduling on two unrelated selfish machines |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New bounds for truthful scheduling on two unrelated selfish machines |
scientific article |
Statements
New bounds for truthful scheduling on two unrelated selfish machines (English)
0 references
27 February 2020
0 references
minimax optimization
0 references
truthful scheduling
0 references
approximation
0 references
piecewise functions
0 references
algorithmic mechanism design
0 references
0 references
0.8779553771018982
0 references
0.8771712779998779
0 references
0.840615451335907
0 references
0.8365116119384766
0 references
0.834372878074646
0 references
