Derives polynomial PoA growth for degree<1 monomials and shows a no-knowledge coordination mechanism reduces PoA from Θ(√n) to 2 for unit activation costs in scheduling games.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Price of Anarchy of Cost-Sharing in Real-Time Scheduling Systems
Derives polynomial PoA growth for degree<1 monomials and shows a no-knowledge coordination mechanism reduces PoA from Θ(√n) to 2 for unit activation costs in scheduling games.