An optimal lower bound for anonymous scheduling mechanisms.
Itai AshlagiShahar DobzinskiRon LaviPublished in: EC (2009)
Keyphrases
- lower bound
- optimal solution
- worst case
- upper bound
- dynamic programming
- objective function
- optimal cost
- scheduling problem
- closed form
- round robin
- np hard
- peer to peer
- optimal scheduling
- constant factor
- competitive ratio
- lower and upper bounds
- branch and bound
- resource allocation
- optimal strategy
- minimum cost
- scheduling algorithm
- response time
- supply chain